Base | Representation |
---|---|
bin | 1010011110010100101010… |
… | …11101001101000100101101 |
3 | 10000112211221012010122020121 |
4 | 11033022111131031010231 |
5 | 11004324241224231221 |
6 | 120552451045444541 |
7 | 4565005312444222 |
oct | 517122535150455 |
9 | 100484835118217 |
10 | 23032122102061 |
11 | 737a9605314a6 |
12 | 26bb943110751 |
13 | cb0bc5a34a07 |
14 | 598a9135d949 |
15 | 29e1b9684a41 |
hex | 14f29574d12d |
23032122102061 has 2 divisors, whose sum is σ = 23032122102062. Its totient is φ = 23032122102060.
The previous prime is 23032122101987. The next prime is 23032122102107. The reversal of 23032122102061 is 16020122123032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21607799199561 + 1424322902500 = 4648419^2 + 1193450^2 .
It is a cyclic number.
It is not a de Polignac number, because 23032122102061 - 217 = 23032121970989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23032122102361) 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 as a sum of consecutive naturals, namely, 11516061051030 + 11516061051031.
It is an arithmetic number, because the mean of its divisors is an integer number (11516061051031).
Almost surely, 223032122102061 is an apocalyptic number.
It is an amenable number.
23032122102061 is a deficient number, since it is larger than the sum of its proper divisors (1).
23032122102061 is an equidigital number, since it uses as much as digits as its factorization.
23032122102061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 23032122102061 its reverse (16020122123032), we get a palindrome (39052244225093).
The spelling of 23032122102061 in words is "twenty-three trillion, thirty-two billion, one hundred twenty-two million, one hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •