Base | Representation |
---|---|
bin | 1001001101101101010010… |
… | …1111011110101001000111 |
3 | 1022212112010220221222111011 |
4 | 2103123110233132221013 |
5 | 2311441444114200124 |
6 | 33314055234023051 |
7 | 2063643103662304 |
oct | 223332457365107 |
9 | 38775126858434 |
10 | 10131102100039 |
11 | 3256638022228 |
12 | 1177585717a87 |
13 | 58648846784b |
14 | 2704c2b220ab |
15 | 1287ee904994 |
hex | 936d4bdea47 |
10131102100039 has 2 divisors, whose sum is σ = 10131102100040. Its totient is φ = 10131102100038.
The previous prime is 10131102099973. The next prime is 10131102100043. The reversal of 10131102100039 is 93000120113101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10131102100039 - 239 = 9581346286151 is a prime.
It is a super-2 number, since 2×101311021000392 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10131102099992 and 10131102100019.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131102110039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065551050019 + 5065551050020.
It is an arithmetic number, because the mean of its divisors is an integer number (5065551050020).
Almost surely, 210131102100039 is an apocalyptic number.
10131102100039 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131102100039 is an equidigital number, since it uses as much as digits as its factorization.
10131102100039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 10131102100039 in words is "ten trillion, one hundred thirty-one billion, one hundred two million, one hundred thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •