Base | Representation |
---|---|
bin | 1001001011111010100110… |
… | …0100011011100001101011 |
3 | 1022202120200011212021021101 |
4 | 2102332221210123201223 |
5 | 2310440420112343311 |
6 | 33252004133022231 |
7 | 2061503113026223 |
oct | 222765144334153 |
9 | 38676604767241 |
10 | 10100313012331 |
11 | 32445784209a3 |
12 | 1171612484977 |
13 | 5835bc770759 |
14 | 26cc0198d083 |
15 | 127aeb8abec1 |
hex | 92fa991b86b |
10100313012331 has 2 divisors, whose sum is σ = 10100313012332. Its totient is φ = 10100313012330.
The previous prime is 10100313012323. The next prime is 10100313012359. The reversal of 10100313012331 is 13321031300101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10100313012331 - 23 = 10100313012323 is a prime.
It is a super-2 number, since 2×101003130123312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10100313012299 and 10100313012308.
It is not a weakly prime, because it can be changed into another prime (10100313012631) 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, 5050156506165 + 5050156506166.
It is an arithmetic number, because the mean of its divisors is an integer number (5050156506166).
Almost surely, 210100313012331 is an apocalyptic number.
10100313012331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100313012331 is an equidigital number, since it uses as much as digits as its factorization.
10100313012331 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 19.
Adding to 10100313012331 its reverse (13321031300101), we get a palindrome (23421344312432).
The spelling of 10100313012331 in words is "ten trillion, one hundred billion, three hundred thirteen million, twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •