Base | Representation |
---|---|
bin | 100001101001100111101… |
… | …101101101110000100001 |
3 | 22012001210101121101111212 |
4 | 201221213231231300201 |
5 | 300341330201124101 |
6 | 4530152232315505 |
7 | 326032142306234 |
oct | 41514755556041 |
9 | 8161711541455 |
10 | 2312432442401 |
11 | 811773913074 |
12 | 3141b8b42b95 |
13 | 13a0a4cb7973 |
14 | 7dccac1b41b |
15 | 40241d7d1bb |
hex | 21a67b6dc21 |
2312432442401 has 2 divisors, whose sum is σ = 2312432442402. Its totient is φ = 2312432442400.
The previous prime is 2312432442317. The next prime is 2312432442409. The reversal of 2312432442401 is 1042442342132.
It is a happy number.
2312432442401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1350885500176 + 961546942225 = 1162276^2 + 980585^2 .
It is a cyclic number.
It is not a de Polignac number, because 2312432442401 - 230 = 2311358700577 is a prime.
It is not a weakly prime, because it can be changed into another prime (2312432442409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156216221200 + 1156216221201.
It is an arithmetic number, because the mean of its divisors is an integer number (1156216221201).
Almost surely, 22312432442401 is an apocalyptic number.
It is an amenable number.
2312432442401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2312432442401 is an equidigital number, since it uses as much as digits as its factorization.
2312432442401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 2312432442401 its reverse (1042442342132), we get a palindrome (3354874784533).
The spelling of 2312432442401 in words is "two trillion, three hundred twelve billion, four hundred thirty-two million, four hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •