Base | Representation |
---|---|
bin | 1010011110100101110010… |
… | …01011010001000010000101 |
3 | 10000120201122121020222022111 |
4 | 11033102321023101002011 |
5 | 11010002101144022203 |
6 | 121001010550301021 |
7 | 4565452113451564 |
oct | 517227113210205 |
9 | 100521577228274 |
10 | 23041311314053 |
11 | 738384660747a |
12 | 2701688657771 |
13 | cb1a2b762b66 |
14 | 5992c3949bdb |
15 | 29e55628926d |
hex | 14f4b92d1085 |
23041311314053 has 2 divisors, whose sum is σ = 23041311314054. Its totient is φ = 23041311314052.
The previous prime is 23041311314011. The next prime is 23041311314069. The reversal of 23041311314053 is 35041311314032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16080404761444 + 6960906552609 = 4010038^2 + 2638353^2 .
It is a cyclic number.
It is not a de Polignac number, because 23041311314053 - 233 = 23032721379461 is a prime.
It is a super-2 number, since 2×230413113140532 (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 (23041311314003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11520655657026 + 11520655657027.
It is an arithmetic number, because the mean of its divisors is an integer number (11520655657027).
Almost surely, 223041311314053 is an apocalyptic number.
It is an amenable number.
23041311314053 is a deficient number, since it is larger than the sum of its proper divisors (1).
23041311314053 is an equidigital number, since it uses as much as digits as its factorization.
23041311314053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 23041311314053 its reverse (35041311314032), we get a palindrome (58082622628085).
The spelling of 23041311314053 in words is "twenty-three trillion, forty-one billion, three hundred eleven million, three hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •