Base | Representation |
---|---|
bin | 10010110111101111… |
… | …10110011011100000 |
3 | 222011001211110202120 |
4 | 21123313312123200 |
5 | 131222103131422 |
6 | 4353152544240 |
7 | 506030434641 |
oct | 113367663340 |
9 | 28131743676 |
10 | 10131302112 |
11 | 4329946258 |
12 | 1b68b52080 |
13 | c55c70829 |
14 | 6c17816c8 |
15 | 3e469745c |
hex | 25bdf66e0 |
10131302112 has 48 divisors (see below), whose sum is σ = 27313452432. Its totient is φ = 3285826560.
The previous prime is 10131302101. The next prime is 10131302119. The reversal of 10131302112 is 21120313101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 10131302091 and 10131302100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131302119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1422589 + ... + 1429692.
It is an arithmetic number, because the mean of its divisors is an integer number (569030259).
Almost surely, 210131302112 is an apocalyptic number.
10131302112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10131302112 is an abundant number, since it is smaller than the sum of its proper divisors (17182150320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131302112 is a wasteful number, since it uses less digits than its factorization.
10131302112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2852331 (or 2852323 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10131302112 its reverse (21120313101), we get a palindrome (31251615213).
The spelling of 10131302112 in words is "ten billion, one hundred thirty-one million, three hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •