Base | Representation |
---|---|
bin | 1010011110010011100011… |
… | …01101111101000100001001 |
3 | 10000112210101101220100220022 |
4 | 11033021301231331010021 |
5 | 11004322024230410121 |
6 | 120552311350310225 |
7 | 4564654412146511 |
oct | 517116155750411 |
9 | 100483341810808 |
10 | 23031522513161 |
11 | 737a683034488 |
12 | 26bb7b6358375 |
13 | cb0b2b751296 |
14 | 598a35882841 |
15 | 29e181be8aab |
hex | 14f271b7d109 |
23031522513161 has 2 divisors, whose sum is σ = 23031522513162. Its totient is φ = 23031522513160.
The previous prime is 23031522512969. The next prime is 23031522513163. The reversal of 23031522513161 is 16131522513032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15300653676025 + 7730868837136 = 3911605^2 + 2780444^2 .
It is a cyclic number.
It is not a de Polignac number, because 23031522513161 - 214 = 23031522496777 is a prime.
Together with 23031522513163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (23031522513163) 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, 11515761256580 + 11515761256581.
It is an arithmetic number, because the mean of its divisors is an integer number (11515761256581).
Almost surely, 223031522513161 is an apocalyptic number.
It is an amenable number.
23031522513161 is a deficient number, since it is larger than the sum of its proper divisors (1).
23031522513161 is an equidigital number, since it uses as much as digits as its factorization.
23031522513161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 23031522513161 in words is "twenty-three trillion, thirty-one billion, five hundred twenty-two million, five hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •