Base | Representation |
---|---|
bin | 1010011110110001110010… |
… | …11000100101011110010001 |
3 | 10000121100021211102210011002 |
4 | 11033120321120211132101 |
5 | 11010103301324202333 |
6 | 121003554333231345 |
7 | 4566100624200146 |
oct | 517307130453621 |
9 | 100540254383132 |
10 | 23047757256593 |
11 | 7386554132513 |
12 | 2702987332555 |
13 | cb2518037844 |
14 | 599735a7c3cd |
15 | 29e7d210d0e8 |
hex | 14f639625791 |
23047757256593 has 2 divisors, whose sum is σ = 23047757256594. Its totient is φ = 23047757256592.
The previous prime is 23047757256509. The next prime is 23047757256617. The reversal of 23047757256593 is 39565275774032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19592556617104 + 3455200639489 = 4426348^2 + 1858817^2 .
It is a cyclic number.
It is not a de Polignac number, because 23047757256593 - 210 = 23047757255569 is a prime.
It is a super-2 number, since 2×230477572565932 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23047057256593) 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, 11523878628296 + 11523878628297.
It is an arithmetic number, because the mean of its divisors is an integer number (11523878628297).
Almost surely, 223047757256593 is an apocalyptic number.
It is an amenable number.
23047757256593 is a deficient number, since it is larger than the sum of its proper divisors (1).
23047757256593 is an equidigital number, since it uses as much as digits as its factorization.
23047757256593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 333396000, while the sum is 65.
The spelling of 23047757256593 in words is "twenty-three trillion, forty-seven billion, seven hundred fifty-seven million, two hundred fifty-six thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •