Base | Representation |
---|---|
bin | 1001011000001111001100… |
… | …1101110111101111110101 |
3 | 1100111211002011001120021010 |
4 | 2112003303031313233311 |
5 | 2322422440003310401 |
6 | 33533133542542433 |
7 | 2113006010565021 |
oct | 226036315675765 |
9 | 40454064046233 |
10 | 10312002010101 |
11 | 3316328335130 |
12 | 11a6650737a19 |
13 | 59a55767384c |
14 | 279164253381 |
15 | 12d38b11ced6 |
hex | 960f3377bf5 |
10312002010101 has 32 divisors (see below), whose sum is σ = 15264281502720. Its totient is φ = 6139901174400.
The previous prime is 10312002010091. The next prime is 10312002010111. The reversal of 10312002010101 is 10101020021301.
It is an interprime number because it is at equal distance from previous prime (10312002010091) and next prime (10312002010111).
It is not a de Polignac number, because 10312002010101 - 210 = 10312002009077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312002010111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7112896 + ... + 8439033.
It is an arithmetic number, because the mean of its divisors is an integer number (477008796960).
Almost surely, 210312002010101 is an apocalyptic number.
10312002010101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10312002010101 is a deficient number, since it is larger than the sum of its proper divisors (4952279492619).
10312002010101 is a wasteful number, since it uses less digits than its factorization.
10312002010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15552297.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10312002010101 its reverse (10101020021301), we get a palindrome (20413022031402).
The spelling of 10312002010101 in words is "ten trillion, three hundred twelve billion, two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •