Base | Representation |
---|---|
bin | 11110110111010101101… |
… | …000010110000011100001 |
3 | 21111202200100100010211220 |
4 | 132313111220112003201 |
5 | 234222303232000113 |
6 | 4302213023125253 |
7 | 306144301014561 |
oct | 36672550260341 |
9 | 7452610303756 |
10 | 2121003000033 |
11 | 74856a998755 |
12 | 2a3093743829 |
13 | 125018499288 |
14 | 7492b0c4da1 |
15 | 3a28b058523 |
hex | 1edd5a160e1 |
2121003000033 has 8 divisors (see below), whose sum is σ = 2829196756896. Its totient is φ = 1413405621600.
The previous prime is 2121003000031. The next prime is 2121003000091. The reversal of 2121003000033 is 3300003001212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2121003000033 - 21 = 2121003000031 is a prime.
It is a super-2 number, since 2×21210030000332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2121002999976 and 2121003000021.
It is not an unprimeable number, because it can be changed into a prime (2121003000031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149086308 + ... + 149100533.
It is an arithmetic number, because the mean of its divisors is an integer number (353649594612).
Almost surely, 22121003000033 is an apocalyptic number.
It is an amenable number.
2121003000033 is a deficient number, since it is larger than the sum of its proper divisors (708193756863).
2121003000033 is a wasteful number, since it uses less digits than its factorization.
2121003000033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298189215.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2121003000033 its reverse (3300003001212), we get a palindrome (5421006001245).
The spelling of 2121003000033 in words is "two trillion, one hundred twenty-one billion, three million, thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •