Base | Representation |
---|---|
bin | 11110110111010111001… |
… | …111011000010010110001 |
3 | 21111202202020011101121021 |
4 | 132313113033120102301 |
5 | 234222332140310113 |
6 | 4302215430055441 |
7 | 306145046421124 |
oct | 36672717302261 |
9 | 7452666141537 |
10 | 2121030010033 |
11 | 748584166770 |
12 | 2a30a07aa581 |
13 | 125020c6531c |
14 | 749309163bb |
15 | 3a28d5e148d |
hex | 1edd73d84b1 |
2121030010033 has 8 divisors (see below), whose sum is σ = 2353068732960. Its totient is φ = 1895527589280.
The previous prime is 2121030010013. The next prime is 2121030010061. The reversal of 2121030010033 is 3300100301212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2121030010033 - 29 = 2121030009521 is a prime.
It is a super-2 number, since 2×21210300100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2121030009989 and 2121030010016.
It is not an unprimeable number, because it can be changed into a prime (2121030010013) 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, 1634074860 + ... + 1634076157.
It is an arithmetic number, because the mean of its divisors is an integer number (294133591620).
Almost surely, 22121030010033 is an apocalyptic number.
It is an amenable number.
2121030010033 is a deficient number, since it is larger than the sum of its proper divisors (232038722927).
2121030010033 is a wasteful number, since it uses less digits than its factorization.
2121030010033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3268151087.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2121030010033 its reverse (3300100301212), we get a palindrome (5421130311245).
The spelling of 2121030010033 in words is "two trillion, one hundred twenty-one billion, thirty million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •