Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11010000001000000 |
3 | 222001222101021101211 |
4 | 21122011122001000 |
5 | 131141413120222 |
6 | 4350201535504 |
7 | 505214434024 |
oct | 113205320100 |
9 | 28058337354 |
10 | 10101301312 |
11 | 4313a15203 |
12 | 1b5aaa4594 |
13 | c4c99838b |
14 | 6bb7b2384 |
15 | 3e1c1d277 |
hex | 25a15a040 |
10101301312 has 56 divisors (see below), whose sum is σ = 20539655136. Its totient is φ = 4926286848.
The previous prime is 10101301307. The next prime is 10101301321. The reversal of 10101301312 is 21310310101.
It is a junction number, because it is equal to n+sod(n) for n = 10101301292 and 10101301301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2356323 + ... + 2360605.
It is an arithmetic number, because the mean of its divisors is an integer number (366779556).
Almost surely, 210101301312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10101301312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10269827568).
10101301312 is an abundant number, since it is smaller than the sum of its proper divisors (10438353824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101301312 is an equidigital number, since it uses as much as digits as its factorization.
10101301312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5195 (or 5185 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10101301312 its reverse (21310310101), we get a palindrome (31411611413).
The spelling of 10101301312 in words is "ten billion, one hundred one million, three hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •