Base | Representation |
---|---|
bin | 1001000110110001100111… |
… | …1001010110100110000011 |
3 | 1022110010201201102121211101 |
4 | 2101230121321112212003 |
5 | 2303014040311412011 |
6 | 33143241211555231 |
7 | 2052225526212205 |
oct | 221543171264603 |
9 | 38403651377741 |
10 | 10012003232131 |
11 | 32100808a2a7a |
12 | 115848775bb17 |
13 | 578187b82244 |
14 | 26882534c775 |
15 | 12567db012c1 |
hex | 91b19e56983 |
10012003232131 has 16 divisors (see below), whose sum is σ = 10093783680000. Its totient is φ = 9930353018688.
The previous prime is 10012003232093. The next prime is 10012003232213. The reversal of 10012003232131 is 13123230021001.
It is a cyclic number.
It is not a de Polignac number, because 10012003232131 - 213 = 10012003223939 is a prime.
It is a super-2 number, since 2×100120032321312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10012003232099 and 10012003232108.
It is not an unprimeable number, because it can be changed into a prime (10012003292131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1074359890 + ... + 1074369208.
It is an arithmetic number, because the mean of its divisors is an integer number (630861480000).
Almost surely, 210012003232131 is an apocalyptic number.
10012003232131 is a deficient number, since it is larger than the sum of its proper divisors (81780447869).
10012003232131 is a wasteful number, since it uses less digits than its factorization.
10012003232131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15378.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10012003232131 its reverse (13123230021001), we get a palindrome (23135233253132).
The spelling of 10012003232131 in words is "ten trillion, twelve billion, three million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •