Base | Representation |
---|---|
bin | 101011110101010101001… |
… | …110110110001110110001 |
3 | 101122222000112112121212012 |
4 | 223311111032312032301 |
5 | 343322442204430001 |
6 | 10223441515212305 |
7 | 430424113541423 |
oct | 53652516661661 |
9 | 11588015477765 |
10 | 3012202030001 |
11 | a6151657749a |
12 | 407950447095 |
13 | 18b0847ac9b8 |
14 | a5b116a4813 |
15 | 5354aac02bb |
hex | 2bd553b63b1 |
3012202030001 has 4 divisors (see below), whose sum is σ = 3014973146112. Its totient is φ = 3009430913892.
The previous prime is 3012202029979. The next prime is 3012202030003. The reversal of 3012202030001 is 1000302022103.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3012202030001 - 26 = 3012202029937 is a prime.
It is a super-2 number, since 2×30122020300012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3012202030003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1385556425 + ... + 1385558598.
It is an arithmetic number, because the mean of its divisors is an integer number (753743286528).
Almost surely, 23012202030001 is an apocalyptic number.
It is an amenable number.
3012202030001 is a deficient number, since it is larger than the sum of its proper divisors (2771116111).
3012202030001 is a wasteful number, since it uses less digits than its factorization.
3012202030001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2771116110.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 3012202030001 its reverse (1000302022103), we get a palindrome (4012504052104).
The spelling of 3012202030001 in words is "three trillion, twelve billion, two hundred two million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •