Base | Representation |
---|---|
bin | 11101100010111… |
… | …110000101000000 |
3 | 1021112202111101111 |
4 | 131202332011000 |
5 | 2003400101212 |
6 | 121104413104 |
7 | 15166302154 |
oct | 3542760500 |
9 | 1245674344 |
10 | 495706432 |
11 | 2348a4641 |
12 | 11a017194 |
13 | 7b910a20 |
14 | 49b99064 |
15 | 2d7baea7 |
hex | 1d8be140 |
495706432 has 28 divisors (see below), whose sum is σ = 1059335956. Its totient is φ = 228787200.
The previous prime is 495706429. The next prime is 495706433. The reversal of 495706432 is 234607594.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 75620416 + 420086016 = 8696^2 + 20496^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (495706433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 297069 + ... + 298732.
It is an arithmetic number, because the mean of its divisors is an integer number (37833427).
Almost surely, 2495706432 is an apocalyptic number.
It is an amenable number.
495706432 is an abundant number, since it is smaller than the sum of its proper divisors (563629524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495706432 is a wasteful number, since it uses less digits than its factorization.
495706432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595826 (or 595816 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 40.
The square root of 495706432 is about 22264.4656796430. The cubic root of 495706432 is about 791.4221203725.
The spelling of 495706432 in words is "four hundred ninety-five million, seven hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •