Base | Representation |
---|---|
bin | 10010110101001110… |
… | …10111010011110000 |
3 | 222002121010112101102 |
4 | 21122213113103300 |
5 | 131201202444440 |
6 | 4351120423532 |
7 | 505353210563 |
oct | 113247272360 |
9 | 28077115342 |
10 | 10110203120 |
11 | 4318a45276 |
12 | 1b61a77ba8 |
13 | c51794114 |
14 | 6bca4c4da |
15 | 3e28cab15 |
hex | 25a9d74f0 |
10110203120 has 80 divisors (see below), whose sum is σ = 24120143712. Its totient is φ = 3938795520.
The previous prime is 10110203119. The next prime is 10110203123. The reversal of 10110203120 is 2130201101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110203123) 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, 2237984 + ... + 2242496.
Almost surely, 210110203120 is an apocalyptic number.
10110203120 is a gapful number since it is divisible by the number (10) 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 10110203120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12060071856).
10110203120 is an abundant number, since it is smaller than the sum of its proper divisors (14009940592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110203120 is a wasteful number, since it uses less digits than its factorization.
10110203120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5250 (or 5244 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10110203120 its reverse (2130201101), we get a palindrome (12240404221).
The spelling of 10110203120 in words is "ten billion, one hundred ten million, two hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •