Base | Representation |
---|---|
bin | 10010101000000110… |
… | …11001010101000000 |
3 | 221210220222021021020 |
4 | 21110003121111000 |
5 | 130440012022122 |
6 | 4332145025440 |
7 | 502545353211 |
oct | 112403312500 |
9 | 27726867236 |
10 | 10000110912 |
11 | 4271890380 |
12 | 1b31025280 |
13 | c34a28abc |
14 | 6ac191408 |
15 | 3d7dd0c5c |
hex | 2540d9540 |
10000110912 has 112 divisors (see below), whose sum is σ = 29212227072. Its totient is φ = 2993774080.
The previous prime is 10000110881. The next prime is 10000110931. The reversal of 10000110912 is 21901100001.
It is a junction number, because it is equal to n+sod(n) for n = 10000110891 and 10000110900.
It is a congruent number.
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, 146773 + ... + 203819.
It is an arithmetic number, because the mean of its divisors is an integer number (260823456).
Almost surely, 210000110912 is an apocalyptic number.
10000110912 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 10000110912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14606113536).
10000110912 is an abundant number, since it is smaller than the sum of its proper divisors (19212116160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000110912 is a wasteful number, since it uses less digits than its factorization.
10000110912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57156 (or 57146 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 10000110912 its reverse (21901100001), we get a palindrome (31901210913).
The spelling of 10000110912 in words is "ten billion, one hundred ten thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •