Base | Representation |
---|---|
bin | 11110110111011011011… |
… | …111010101101000011101 |
3 | 21111202221012022102012122 |
4 | 132313123133111220131 |
5 | 234223003413133201 |
6 | 4302230454112325 |
7 | 306146603406242 |
oct | 36673337255035 |
9 | 7452835272178 |
10 | 2121101302301 |
11 | 74861042a6a3 |
12 | 2a310064b6a5 |
13 | 1250329670b7 |
14 | 7493a1935c9 |
15 | 3a2949c4e1b |
hex | 1eddb7d5a1d |
2121101302301 has 8 divisors (see below), whose sum is σ = 2140619820864. Its totient is φ = 2101663942560.
The previous prime is 2121101302207. The next prime is 2121101302343. The reversal of 2121101302301 is 1032031011212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121101302301 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2121101302301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121101302361) 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, 20237195 + ... + 20341736.
It is an arithmetic number, because the mean of its divisors is an integer number (267577477608).
Almost surely, 22121101302301 is an apocalyptic number.
It is an amenable number.
2121101302301 is a deficient number, since it is larger than the sum of its proper divisors (19518518563).
2121101302301 is a wasteful number, since it uses less digits than its factorization.
2121101302301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40579411.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2121101302301 its reverse (1032031011212), we get a palindrome (3153132313513).
The spelling of 2121101302301 in words is "two trillion, one hundred twenty-one billion, one hundred one million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •