Base | Representation |
---|---|
bin | 1010011110000100000011… |
… | …01010110001001100000101 |
3 | 10000111222220101221222120212 |
4 | 11033002001222301030011 |
5 | 11004203003221211244 |
6 | 120544413454005205 |
7 | 4564241235366455 |
oct | 517020152611405 |
9 | 100458811858525 |
10 | 23023200178949 |
11 | 73770a2318623 |
12 | 26ba0731a6805 |
13 | cb01034c0679 |
14 | 59848646dd65 |
15 | 29dd4627bd9e |
hex | 14f081ab1305 |
23023200178949 has 2 divisors, whose sum is σ = 23023200178950. Its totient is φ = 23023200178948.
The previous prime is 23023200178921. The next prime is 23023200178961. The reversal of 23023200178949 is 94987100232032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19450128652900 + 3573071526049 = 4410230^2 + 1890257^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23023200178949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23023200178897 and 23023200178906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23023200178969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11511600089474 + 11511600089475.
It is an arithmetic number, because the mean of its divisors is an integer number (11511600089475).
Almost surely, 223023200178949 is an apocalyptic number.
It is an amenable number.
23023200178949 is a deficient number, since it is larger than the sum of its proper divisors (1).
23023200178949 is an equidigital number, since it uses as much as digits as its factorization.
23023200178949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 23023200178949 in words is "twenty-three trillion, twenty-three billion, two hundred million, one hundred seventy-eight thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •