Base | Representation |
---|---|
bin | 1010100111111110011101… |
… | …10101000000100110110001 |
3 | 10001201120001012012120121221 |
4 | 11103333032311000212301 |
5 | 11030243024031004203 |
6 | 121405102532345041 |
7 | 4630656446564053 |
oct | 523771665004661 |
9 | 101646035176557 |
10 | 23363797125553 |
11 | 7498592425765 |
12 | 2754088475181 |
13 | 1006272c6b671 |
14 | 5aab5716d8d3 |
15 | 2a7b2ca3aabd |
hex | 153fced409b1 |
23363797125553 has 2 divisors, whose sum is σ = 23363797125554. Its totient is φ = 23363797125552.
The previous prime is 23363797125541. The next prime is 23363797125607. The reversal of 23363797125553 is 35552179736332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18143408402064 + 5220388723489 = 4259508^2 + 2284817^2 .
It is a cyclic number.
It is not a de Polignac number, because 23363797125553 - 217 = 23363796994481 is a prime.
It is a super-2 number, since 2×233637971255532 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23363797125491 and 23363797125500.
It is not a weakly prime, because it can be changed into another prime (23363797525553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11681898562776 + 11681898562777.
It is an arithmetic number, because the mean of its divisors is an integer number (11681898562777).
Almost surely, 223363797125553 is an apocalyptic number.
It is an amenable number.
23363797125553 is a deficient number, since it is larger than the sum of its proper divisors (1).
23363797125553 is an equidigital number, since it uses as much as digits as its factorization.
23363797125553 is an evil number, because the sum of its binary digits is even.
The product of its digits is 107163000, while the sum is 61.
The spelling of 23363797125553 in words is "twenty-three trillion, three hundred sixty-three billion, seven hundred ninety-seven million, one hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •