Base | Representation |
---|---|
bin | 1010100001001101000100… |
… | …10000100001101000011011 |
3 | 10000220022110121021022222102 |
4 | 11100212202100201220123 |
5 | 11012440014002130021 |
6 | 121110142414314015 |
7 | 4605111513342656 |
oct | 520464220415033 |
9 | 100808417238872 |
10 | 23131121130011 |
11 | 740894293a474 |
12 | 2716b717b890b |
13 | cba3420569ab |
14 | 59d7a349c89d |
15 | 2a1a60a9a00b |
hex | 1509a2421a1b |
23131121130011 has 2 divisors, whose sum is σ = 23131121130012. Its totient is φ = 23131121130010.
The previous prime is 23131121129981. The next prime is 23131121130017. The reversal of 23131121130011 is 11003112113132.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23131121130011 - 26 = 23131121129947 is a prime.
It is a super-4 number, since 4×231311211300114 (a number of 55 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is not a weakly prime, because it can be changed into another prime (23131121130017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11565560565005 + 11565560565006.
It is an arithmetic number, because the mean of its divisors is an integer number (11565560565006).
Almost surely, 223131121130011 is an apocalyptic number.
23131121130011 is a deficient number, since it is larger than the sum of its proper divisors (1).
23131121130011 is an equidigital number, since it uses as much as digits as its factorization.
23131121130011 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 23131121130011 its reverse (11003112113132), we get a palindrome (34134233243143).
The spelling of 23131121130011 in words is "twenty-three trillion, one hundred thirty-one billion, one hundred twenty-one million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •