Base | Representation |
---|---|
bin | 1001001100101001111001… |
… | …1000011001110010111111 |
3 | 1022210210110001212211210221 |
4 | 2103022132120121302333 |
5 | 2311142421103241111 |
6 | 33301504110042211 |
7 | 2062432551322156 |
oct | 223123630316277 |
9 | 38723401784727 |
10 | 10113010212031 |
11 | 32499a3689a71 |
12 | 1173b767a9367 |
13 | 5848641a3b7c |
14 | 26d68801659d |
15 | 1280e144a371 |
hex | 9329e619cbf |
10113010212031 has 2 divisors, whose sum is σ = 10113010212032. Its totient is φ = 10113010212030.
The previous prime is 10113010212029. The next prime is 10113010212079. The reversal of 10113010212031 is 13021201031101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10113010212031 - 21 = 10113010212029 is a prime.
It is a super-2 number, since 2×101130102120312 (a number of 27 digits) contains 22 as substring.
Together with 10113010212029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10113010211996 and 10113010212014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10113010212131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056505106015 + 5056505106016.
It is an arithmetic number, because the mean of its divisors is an integer number (5056505106016).
Almost surely, 210113010212031 is an apocalyptic number.
10113010212031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113010212031 is an equidigital number, since it uses as much as digits as its factorization.
10113010212031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10113010212031 its reverse (13021201031101), we get a palindrome (23134211243132).
The spelling of 10113010212031 in words is "ten trillion, one hundred thirteen billion, ten million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •