Base | Representation |
---|---|
bin | 101011101100000001001… |
… | …000010101011010111100 |
3 | 101122000012120000211202212 |
4 | 223230001020111122330 |
5 | 343142001440231022 |
6 | 10215105300435552 |
7 | 426621225213110 |
oct | 53540110253274 |
9 | 11560176024685 |
10 | 3002201102012 |
11 | a58254289252 |
12 | 405a1b0a8bb8 |
13 | 18a14c859028 |
14 | a544337d740 |
15 | 53162acc3e2 |
hex | 2bb012156bc |
3002201102012 has 24 divisors (see below), whose sum is σ = 6051680968704. Its totient is φ = 1276526451312.
The previous prime is 3002201102003. The next prime is 3002201102039. The reversal of 3002201102012 is 2102011022003.
It is a happy number.
It is a super-2 number, since 2×30022011020122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
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 7 ways as a sum of consecutive naturals, for example, 422128208 + ... + 422135319.
It is an arithmetic number, because the mean of its divisors is an integer number (252153373696).
Almost surely, 23002201102012 is an apocalyptic number.
It is an amenable number.
3002201102012 is an abundant number, since it is smaller than the sum of its proper divisors (3049479866692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3002201102012 is a wasteful number, since it uses less digits than its factorization.
3002201102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844263665 (or 844263663 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 3002201102012 its reverse (2102011022003), we get a palindrome (5104212124015).
The spelling of 3002201102012 in words is "three trillion, two billion, two hundred one million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •