Base | Representation |
---|---|
bin | 11110000101100001… |
… | …111111101001000110 |
3 | 10002101101122200120221 |
4 | 132011201333221012 |
5 | 1012130043132410 |
6 | 22501333214554 |
7 | 2222356261513 |
oct | 360541775106 |
9 | 102341580527 |
10 | 32305052230 |
11 | 127783a5980 |
12 | 6316a9145a |
13 | 307aab8a29 |
14 | 17c663030a |
15 | c911974da |
hex | 78587fa46 |
32305052230 has 64 divisors (see below), whose sum is σ = 67696238592. Its totient is φ = 10969136640.
The previous prime is 32305052189. The next prime is 32305052249. The reversal of 32305052230 is 3225050323.
It is a junction number, because it is equal to n+sod(n) for n = 32305052195 and 32305052204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 169477 + ... + 305503.
It is an arithmetic number, because the mean of its divisors is an integer number (1057753728).
Almost surely, 232305052230 is an apocalyptic number.
32305052230 is an abundant number, since it is smaller than the sum of its proper divisors (35391186362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32305052230 is a wasteful number, since it uses less digits than its factorization.
32305052230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136189.
The product of its (nonzero) digits is 5400, while the sum is 25.
The spelling of 32305052230 in words is "thirty-two billion, three hundred five million, fifty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •