Base | Representation |
---|---|
bin | 1010101010101001010100… |
… | …00111101010000111101001 |
3 | 10002001022210201201112120012 |
4 | 11111110222013222013221 |
5 | 11033243402400212212 |
6 | 121515152445341305 |
7 | 4640414504243123 |
oct | 525245207520751 |
9 | 102038721645505 |
10 | 23455523054057 |
11 | 7523482309446 |
12 | 2769a07267835 |
13 | 1011b00517bc3 |
14 | 5b1379382213 |
15 | 2aa1ea68d922 |
hex | 15552a1ea1e9 |
23455523054057 has 2 divisors, whose sum is σ = 23455523054058. Its totient is φ = 23455523054056.
The previous prime is 23455523054039. The next prime is 23455523054059. The reversal of 23455523054057 is 75045032555432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13144366266256 + 10311156787801 = 3625516^2 + 3211099^2 .
It is a cyclic number.
It is not a de Polignac number, because 23455523054057 - 214 = 23455523037673 is a prime.
Together with 23455523054059, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 23455523053996 and 23455523054014.
It is not a weakly prime, because it can be changed into another prime (23455523054059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11727761527028 + 11727761527029.
It is an arithmetic number, because the mean of its divisors is an integer number (11727761527029).
Almost surely, 223455523054057 is an apocalyptic number.
It is an amenable number.
23455523054057 is a deficient number, since it is larger than the sum of its proper divisors (1).
23455523054057 is an equidigital number, since it uses as much as digits as its factorization.
23455523054057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12600000, while the sum is 50.
The spelling of 23455523054057 in words is "twenty-three trillion, four hundred fifty-five billion, five hundred twenty-three million, fifty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •