Base | Representation |
---|---|
bin | 1001001101101100111011… |
… | …0101110100101111110011 |
3 | 1022212111220000200021011111 |
4 | 2103123032311310233303 |
5 | 2311441243243201042 |
6 | 33314041340054151 |
7 | 2063640462334006 |
oct | 223331665645763 |
9 | 38774800607144 |
10 | 10131003100147 |
11 | 3256597154136 |
12 | 1177558534357 |
13 | 586470ab4327 |
14 | 2704b391153d |
15 | 1287e5d9b517 |
hex | 936ced74bf3 |
10131003100147 has 2 divisors, whose sum is σ = 10131003100148. Its totient is φ = 10131003100146.
The previous prime is 10131003100081. The next prime is 10131003100187. The reversal of 10131003100147 is 74100130013101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131003100147 is a prime.
It is a super-2 number, since 2×101310031001472 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10131003100187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065501550073 + 5065501550074.
It is an arithmetic number, because the mean of its divisors is an integer number (5065501550074).
Almost surely, 210131003100147 is an apocalyptic number.
10131003100147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131003100147 is an equidigital number, since it uses as much as digits as its factorization.
10131003100147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 10131003100147 its reverse (74100130013101), we get a palindrome (84231133113248).
The spelling of 10131003100147 in words is "ten trillion, one hundred thirty-one billion, three million, one hundred thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •