Base | Representation |
---|---|
bin | 11110110111101001001… |
… | …000001010111101101001 |
3 | 21111210112010212001210110 |
4 | 132313221020022331221 |
5 | 234223441002012223 |
6 | 4302305310204533 |
7 | 306155352266061 |
oct | 36675110127551 |
9 | 7453463761713 |
10 | 2121330110313 |
11 | 7487185a9527 |
12 | 2a31651b3749 |
13 | 12506b19995b |
14 | 7495c7143a1 |
15 | 3a2a9b1ed93 |
hex | 1ede920af69 |
2121330110313 has 16 divisors (see below), whose sum is σ = 2884984433856. Its totient is φ = 1386006772800.
The previous prime is 2121330110281. The next prime is 2121330110359. The reversal of 2121330110313 is 3130110331212.
It is a happy number.
It is not a de Polignac number, because 2121330110313 - 25 = 2121330110281 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2121330110313.
It is not an unprimeable number, because it can be changed into a prime (2121330110113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7210638 + ... + 7499063.
It is an arithmetic number, because the mean of its divisors is an integer number (180311527116).
Almost surely, 22121330110313 is an apocalyptic number.
It is an amenable number.
2121330110313 is a deficient number, since it is larger than the sum of its proper divisors (763654323543).
2121330110313 is a wasteful number, since it uses less digits than its factorization.
2121330110313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14710664.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 2121330110313 its reverse (3130110331212), we get a palindrome (5251440441525).
The spelling of 2121330110313 in words is "two trillion, one hundred twenty-one billion, three hundred thirty million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •