Base | Representation |
---|---|
bin | 101100001000000100010… |
… | …110111100000111001110 |
3 | 101201212221121010002002220 |
4 | 230020010112330013032 |
5 | 344140142412030410 |
6 | 10241010102000210 |
7 | 432035501002155 |
oct | 54100426740716 |
9 | 11655847102086 |
10 | 3032320033230 |
11 | a69aaa674044 |
12 | 40b825a16066 |
13 | 18cc3c762717 |
14 | a6a9d50659c |
15 | 53d26d9a070 |
hex | 2c2045bc1ce |
3032320033230 has 16 divisors (see below), whose sum is σ = 7277568079824. Its totient is φ = 808618675520.
The previous prime is 3032320033213. The next prime is 3032320033247. The reversal of 3032320033230 is 323300232303.
It is an interprime number because it is at equal distance from previous prime (3032320033213) and next prime (3032320033247).
It is a self number, because there is not a number n which added to its sum of digits gives 3032320033230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50538667191 + ... + 50538667250.
It is an arithmetic number, because the mean of its divisors is an integer number (454848004989).
Almost surely, 23032320033230 is an apocalyptic number.
3032320033230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3032320033230 is an abundant number, since it is smaller than the sum of its proper divisors (4245248046594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3032320033230 is a wasteful number, since it uses less digits than its factorization.
3032320033230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101077334451.
The product of its (nonzero) digits is 5832, while the sum is 24.
Adding to 3032320033230 its reverse (323300232303), we get a palindrome (3355620265533).
The spelling of 3032320033230 in words is "three trillion, thirty-two billion, three hundred twenty million, thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •