Base | Representation |
---|---|
bin | 1010100000100111100111… |
… | …01110100110011101000101 |
3 | 10000211101120020112012110002 |
4 | 11100103303232212131011 |
5 | 11012122323330211401 |
6 | 121053015230211045 |
7 | 4603500310233236 |
oct | 520236356463505 |
9 | 100741506465402 |
10 | 23111013132101 |
11 | 7400364456a84 |
12 | 271309b653a85 |
13 | cb848919808b |
14 | 59c816b0308d |
15 | 2a12855e9a6b |
hex | 1504f3ba6745 |
23111013132101 has 2 divisors, whose sum is σ = 23111013132102. Its totient is φ = 23111013132100.
The previous prime is 23111013132083. The next prime is 23111013132113. The reversal of 23111013132101 is 10123131011132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13690932415876 + 9420080716225 = 3700126^2 + 3069215^2 .
It is a cyclic number.
It is not a de Polignac number, because 23111013132101 - 238 = 22836135225157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23111013132001) 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, 11555506566050 + 11555506566051.
It is an arithmetic number, because the mean of its divisors is an integer number (11555506566051).
Almost surely, 223111013132101 is an apocalyptic number.
It is an amenable number.
23111013132101 is a deficient number, since it is larger than the sum of its proper divisors (1).
23111013132101 is an equidigital number, since it uses as much as digits as its factorization.
23111013132101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 23111013132101 its reverse (10123131011132), we get a palindrome (33234144143233).
The spelling of 23111013132101 in words is "twenty-three trillion, one hundred eleven billion, thirteen million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •