Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …1000111000010101100100 |
3 | 1022102002121000001100102001 |
4 | 2101202100020320111210 |
5 | 2302324224120041400 |
6 | 33134235355055044 |
7 | 2051361430215151 |
oct | 221422010702544 |
9 | 38362530040361 |
10 | 10001102112100 |
11 | 3206497461170 |
12 | 1156344a41484 |
13 | 57713b598668 |
14 | 2680ad65b228 |
15 | 125241a94a6a |
hex | 91890238564 |
10001102112100 has 72 divisors (see below), whose sum is σ = 23675912769600. Its totient is φ = 3636675849600.
The previous prime is 10001102112083. The next prime is 10001102112121. The reversal of 10001102112100 is 121120110001.
It is a super-3 number, since 3×100011021121003 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 59832441 + ... + 59999359.
It is an arithmetic number, because the mean of its divisors is an integer number (328832121800).
Almost surely, 210001102112100 is an apocalyptic number.
10001102112100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001102112100 is an abundant number, since it is smaller than the sum of its proper divisors (13674810657500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001102112100 is a wasteful number, since it uses less digits than its factorization.
10001102112100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221413 (or 221406 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10001102112100 its reverse (121120110001), we get a palindrome (10122222222101).
The spelling of 10001102112100 in words is "ten trillion, one billion, one hundred two million, one hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •