Base | Representation |
---|---|
bin | 11110110111011101001… |
… | …110000010110101110001 |
3 | 21111210000012220211112221 |
4 | 132313131032002311301 |
5 | 234223033330321223 |
6 | 4302233412121041 |
7 | 306150405156511 |
oct | 36673516026561 |
9 | 7453005824487 |
10 | 2121130323313 |
11 | 748625851601 |
12 | 2a310a306181 |
13 | 1250389885b1 |
14 | 7493dd89841 |
15 | 3a297308b5d |
hex | 1eddd382d71 |
2121130323313 has 2 divisors, whose sum is σ = 2121130323314. Its totient is φ = 2121130323312.
The previous prime is 2121130323293. The next prime is 2121130323379. The reversal of 2121130323313 is 3133230311212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1886919817104 + 234210506209 = 1373652^2 + 483953^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121130323313 is a prime.
It is a super-4 number, since 4×21211303233134 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (2121130323383) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060565161656 + 1060565161657.
It is an arithmetic number, because the mean of its divisors is an integer number (1060565161657).
Almost surely, 22121130323313 is an apocalyptic number.
It is an amenable number.
2121130323313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121130323313 is an equidigital number, since it uses as much as digits as its factorization.
2121130323313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 2121130323313 its reverse (3133230311212), we get a palindrome (5254360634525).
The spelling of 2121130323313 in words is "two trillion, one hundred twenty-one billion, one hundred thirty million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •