Base | Representation |
---|---|
bin | 10011000000000100… |
… | …01001111000100100 |
3 | 222022221012012001200 |
4 | 21200002021320210 |
5 | 131342441041400 |
6 | 4404125122500 |
7 | 510536010414 |
oct | 114002117044 |
9 | 28287165050 |
10 | 10201112100 |
11 | 4365297563 |
12 | 1b883b9430 |
13 | c67573a0a |
14 | 6cab54644 |
15 | 3ea886b00 |
hex | 260089e24 |
10201112100 has 108 divisors (see below), whose sum is σ = 32000566416. Its totient is φ = 2718106560.
The previous prime is 10201112081. The next prime is 10201112113. The reversal of 10201112100 is 121110201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 35 ways as a sum of consecutive naturals, for example, 1330879 + ... + 1338521.
Almost surely, 210201112100 is an apocalyptic number.
10201112100 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 10201112100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16000283208).
10201112100 is an abundant number, since it is smaller than the sum of its proper divisors (21799454316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201112100 is a wasteful number, since it uses less digits than its factorization.
10201112100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9146 (or 9136 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10201112100 its reverse (121110201), we get a palindrome (10322222301).
The spelling of 10201112100 in words is "ten billion, two hundred one million, one hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •