Base | Representation |
---|---|
bin | 1010011110000100011110… |
… | …00000101111101111101101 |
3 | 10000112000111000012111201112 |
4 | 11033002033000233233231 |
5 | 11004203433023402023 |
6 | 120544452012121405 |
7 | 4564246624251341 |
oct | 517021700575755 |
9 | 100460430174645 |
10 | 23023424044013 |
11 | 73771a7720778 |
12 | 26ba116166265 |
13 | cb013a9b23c3 |
14 | 5984a80a5621 |
15 | 29dd5ac4c478 |
hex | 14f08f02fbed |
23023424044013 has 2 divisors, whose sum is σ = 23023424044014. Its totient is φ = 23023424044012.
The previous prime is 23023424044003. The next prime is 23023424044043. The reversal of 23023424044013 is 31044042432032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12707777651209 + 10315646392804 = 3564797^2 + 3211798^2 .
It is a cyclic number.
It is not a de Polignac number, because 23023424044013 - 214 = 23023424027629 is a prime.
It is a super-2 number, since 2×230234240440132 (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 (23023424044003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11511712022006 + 11511712022007.
It is an arithmetic number, because the mean of its divisors is an integer number (11511712022007).
Almost surely, 223023424044013 is an apocalyptic number.
It is an amenable number.
23023424044013 is a deficient number, since it is larger than the sum of its proper divisors (1).
23023424044013 is an equidigital number, since it uses as much as digits as its factorization.
23023424044013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 23023424044013 its reverse (31044042432032), we get a palindrome (54067466476045).
The spelling of 23023424044013 in words is "twenty-three trillion, twenty-three billion, four hundred twenty-four million, forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •