Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001001011101001101010000 |
3 | 111010002000001201001200110122 |
4 | 112233031030021131031100 |
5 | 101101404022240200422 |
6 | 552403454203445412 |
7 | 30030556013304410 |
oct | 2657151411351520 |
9 | 433060051050418 |
10 | 100001001100112 |
11 | 29955206111542 |
12 | b270a44b26868 |
13 | 43a5091679a88 |
14 | 1a9a107b68640 |
15 | b863c761bd42 |
hex | 5af34c25d350 |
100001001100112 has 40 divisors (see below), whose sum is σ = 221618282760192. Its totient is φ = 42821282620800.
The previous prime is 100001001100109. The next prime is 100001001100159. The reversal of 100001001100112 is 211001100100001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 100001001100112.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 377880464 + ... + 378145007.
Almost surely, 2100001001100112 is an apocalyptic number.
It is an amenable number.
100001001100112 is an abundant number, since it is smaller than the sum of its proper divisors (121617281660080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001001100112 is a wasteful number, since it uses less digits than its factorization.
100001001100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756026667 (or 756026661 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100001001100112 its reverse (211001100100001), we get a palindrome (311002101200113).
The spelling of 100001001100112 in words is "one hundred trillion, one billion, one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •