Base | Representation |
---|---|
bin | 1001001001111001001000… |
… | …11011111110100001011111 |
3 | 2122021111221120120120222101 |
4 | 10210330210123332201133 |
5 | 10114312014443430421 |
6 | 110452035451425531 |
7 | 4145265665261332 |
oct | 444744433764137 |
9 | 78244846516871 |
10 | 20131123030111 |
11 | 646161a151325 |
12 | 23116684552a7 |
13 | b30483a40912 |
14 | 4d84cc93c619 |
15 | 24d9cb5ce191 |
hex | 124f246fe85f |
20131123030111 has 2 divisors, whose sum is σ = 20131123030112. Its totient is φ = 20131123030110.
The previous prime is 20131123030021. The next prime is 20131123030141. The reversal of 20131123030111 is 11103032113102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20131123030111 - 223 = 20131114641503 is a prime.
It is a super-2 number, since 2×201311230301112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20131123030141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065561515055 + 10065561515056.
It is an arithmetic number, because the mean of its divisors is an integer number (10065561515056).
Almost surely, 220131123030111 is an apocalyptic number.
20131123030111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131123030111 is an equidigital number, since it uses as much as digits as its factorization.
20131123030111 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 19.
Adding to 20131123030111 its reverse (11103032113102), we get a palindrome (31234155143213).
The spelling of 20131123030111 in words is "twenty trillion, one hundred thirty-one billion, one hundred twenty-three million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.605 sec. • engine limits •