Base | Representation |
---|---|
bin | 1010100000100110100000… |
… | …00001000110111111110101 |
3 | 10000211100000111011100111022 |
4 | 11100103100001012333311 |
5 | 11012120111441113323 |
6 | 121052435544550525 |
7 | 4603446413565554 |
oct | 520232001067765 |
9 | 100740014140438 |
10 | 23110414004213 |
11 | 7400087244368 |
12 | 2712b52a82445 |
13 | cb83c2016433 |
14 | 59c79b305d9b |
15 | 2a124cc004c8 |
hex | 1504d0046ff5 |
23110414004213 has 2 divisors, whose sum is σ = 23110414004214. Its totient is φ = 23110414004212.
The previous prime is 23110414004179. The next prime is 23110414004369. The reversal of 23110414004213 is 31240041401132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20660506616689 + 2449907387524 = 4545383^2 + 1565218^2 .
It is a cyclic number.
It is not a de Polignac number, because 23110414004213 - 26 = 23110414004149 is a prime.
It is a super-2 number, since 2×231104140042132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23110414004813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11555207002106 + 11555207002107.
It is an arithmetic number, because the mean of its divisors is an integer number (11555207002107).
Almost surely, 223110414004213 is an apocalyptic number.
It is an amenable number.
23110414004213 is a deficient number, since it is larger than the sum of its proper divisors (1).
23110414004213 is an equidigital number, since it uses as much as digits as its factorization.
23110414004213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 23110414004213 its reverse (31240041401132), we get a palindrome (54350455405345).
The spelling of 23110414004213 in words is "twenty-three trillion, one hundred ten billion, four hundred fourteen million, four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •