Base | Representation |
---|---|
bin | 101011101011111100010… |
… | …011011000001110111000 |
3 | 101121222222220122002000221 |
4 | 223223330103120032320 |
5 | 343141320222023112 |
6 | 10215053244505424 |
7 | 426616222621600 |
oct | 53537423301670 |
9 | 11558886562027 |
10 | 3002120111032 |
11 | a582125a0559 |
12 | 4059b7b4b274 |
13 | 18a138b3c883 |
14 | a54366d9c00 |
15 | 5315a92ee07 |
hex | 2bafc4d83b8 |
3002120111032 has 48 divisors (see below), whose sum is σ = 6576585615000. Its totient is φ = 1281004425792.
The previous prime is 3002120111009. The next prime is 3002120111041. The reversal of 3002120111032 is 2301110212003.
It is a super-2 number, since 2×30021201110322 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3002120110997 and 3002120111015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16631782 + ... + 16811317.
Almost surely, 23002120111032 is an apocalyptic number.
It is an amenable number.
3002120111032 is an abundant number, since it is smaller than the sum of its proper divisors (3574465503968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3002120111032 is a wasteful number, since it uses less digits than its factorization.
3002120111032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33443348 (or 33443337 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3002120111032 its reverse (2301110212003), we get a palindrome (5303230323035).
The spelling of 3002120111032 in words is "three trillion, two billion, one hundred twenty million, one hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •