Base | Representation |
---|---|
bin | 10011001101011100… |
… | …10001110010100000 |
3 | 222121202101001200210 |
4 | 21212232101302200 |
5 | 132110203421422 |
6 | 4423214414120 |
7 | 513400650543 |
oct | 114656216240 |
9 | 28552331623 |
10 | 10313342112 |
11 | 4412681637 |
12 | 1bb9b01340 |
13 | c848aa0c8 |
14 | 6dba0a85a |
15 | 40565510c |
hex | 266b91ca0 |
10313342112 has 96 divisors (see below), whose sum is σ = 27848923200. Its totient is φ = 3339491328.
The previous prime is 10313342099. The next prime is 10313342159. The reversal of 10313342112 is 21124331301.
It is a tau number, because it is divible by the number of its divisors (96).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2622964 + ... + 2626892.
It is an arithmetic number, because the mean of its divisors is an integer number (290092950).
Almost surely, 210313342112 is an apocalyptic number.
10313342112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10313342112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13924461600).
10313342112 is an abundant number, since it is smaller than the sum of its proper divisors (17535581088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10313342112 is a wasteful number, since it uses less digits than its factorization.
10313342112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4718 (or 4710 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10313342112 its reverse (21124331301), we get a palindrome (31437673413).
The spelling of 10313342112 in words is "ten billion, three hundred thirteen million, three hundred forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •