Base | Representation |
---|---|
bin | 10010110101011101… |
… | …01001000110011000 |
3 | 222002201201110111122 |
4 | 21122232221012120 |
5 | 131202200023000 |
6 | 4351225344412 |
7 | 505405345115 |
oct | 113256510630 |
9 | 28081643448 |
10 | 10112111000 |
11 | 431a028732 |
12 | 1b62638108 |
13 | c51cb1644 |
14 | 6bcdc790c |
15 | 3e2b56085 |
hex | 25aba9198 |
10112111000 has 128 divisors (see below), whose sum is σ = 24876633600. Its totient is φ = 3839932800.
The previous prime is 10112110993. The next prime is 10112111027. The reversal of 10112111000 is 11121101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3195419 + ... + 3198581.
It is an arithmetic number, because the mean of its divisors is an integer number (194348700).
Almost surely, 210112111000 is an apocalyptic number.
10112111000 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 10112111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12438316800).
10112111000 is an abundant number, since it is smaller than the sum of its proper divisors (14764522600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112111000 is a wasteful number, since it uses less digits than its factorization.
10112111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3346 (or 3332 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10112111000 its reverse (11121101), we get a palindrome (10123232101).
The spelling of 10112111000 in words is "ten billion, one hundred twelve million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •