Base | Representation |
---|---|
bin | 1001001101101101010101… |
… | …1001100001000111100111 |
3 | 1022212112011200200212100102 |
4 | 2103123111121201013213 |
5 | 2311442004424321411 |
6 | 33314100310134315 |
7 | 2063643266441165 |
oct | 223332531410747 |
9 | 38775150625312 |
10 | 10131113120231 |
11 | 3256643269924 |
12 | 117758935139b |
13 | 58648a82587c |
14 | 2704c4390235 |
15 | 12880087ed3b |
hex | 936d56611e7 |
10131113120231 has 2 divisors, whose sum is σ = 10131113120232. Its totient is φ = 10131113120230.
The previous prime is 10131113120189. The next prime is 10131113120237. The reversal of 10131113120231 is 13202131113101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10131113120231 - 234 = 10113933251047 is a prime.
It is a super-2 number, since 2×101311131202312 (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 (10131113120237) 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, 5065556560115 + 5065556560116.
It is an arithmetic number, because the mean of its divisors is an integer number (5065556560116).
Almost surely, 210131113120231 is an apocalyptic number.
10131113120231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131113120231 is an equidigital number, since it uses as much as digits as its factorization.
10131113120231 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 10131113120231 its reverse (13202131113101), we get a palindrome (23333244233332).
The spelling of 10131113120231 in words is "ten trillion, one hundred thirty-one billion, one hundred thirteen million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •