Base | Representation |
---|---|
bin | 1010011101011110101010… |
… | …11110001010001011011101 |
3 | 10000110002002202212110212112 |
4 | 11032233111132022023131 |
5 | 11003340403104314401 |
6 | 120531254224443405 |
7 | 4562631016052606 |
oct | 516572536121335 |
9 | 100402082773775 |
10 | 23003131323101 |
11 | 7369633a3a146 |
12 | 26b61b2179565 |
13 | cab255787c37 |
14 | 597500d82dad |
15 | 29d56e45e3bb |
hex | 14ebd578a2dd |
23003131323101 has 2 divisors, whose sum is σ = 23003131323102. Its totient is φ = 23003131323100.
The previous prime is 23003131323089. The next prime is 23003131323103. The reversal of 23003131323101 is 10132313130032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19525749252025 + 3477382071076 = 4418795^2 + 1864774^2 .
It is a cyclic number.
It is not a de Polignac number, because 23003131323101 - 218 = 23003131060957 is a prime.
Together with 23003131323103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23003131323103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11501565661550 + 11501565661551.
It is an arithmetic number, because the mean of its divisors is an integer number (11501565661551).
Almost surely, 223003131323101 is an apocalyptic number.
It is an amenable number.
23003131323101 is a deficient number, since it is larger than the sum of its proper divisors (1).
23003131323101 is an equidigital number, since it uses as much as digits as its factorization.
23003131323101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 23003131323101 its reverse (10132313130032), we get a palindrome (33135444453133).
The spelling of 23003131323101 in words is "twenty-three trillion, three billion, one hundred thirty-one million, three hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •