Base | Representation |
---|---|
bin | 101110100111001111… |
… | …1000011011010101000 |
3 | 100120101012201020110000 |
4 | 1131032133003122220 |
5 | 3120001324323422 |
6 | 113552532023000 |
7 | 10142411361354 |
oct | 1351637033250 |
9 | 316335636400 |
10 | 100101011112 |
11 | 394a8458263 |
12 | 17497761a60 |
13 | 959371852b |
14 | 4bb8636464 |
15 | 290d03dcac |
hex | 174e7c36a8 |
100101011112 has 40 divisors (see below), whose sum is σ = 280375519050. Its totient is φ = 33367003488.
The previous prime is 100101011093. The next prime is 100101011117. The reversal of 100101011112 is 211110101001.
It can be written as a sum of positive squares in only one way, i.e., 100100100996 + 910116 = 316386^2 + 954^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100101011094 and 100101011103.
It is not an unprimeable number, because it can be changed into a prime (100101011117) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 77237787 + ... + 77239082.
Almost surely, 2100101011112 is an apocalyptic number.
100101011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100101011112 is an abundant number, since it is smaller than the sum of its proper divisors (180274507938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100101011112 is a wasteful number, since it uses less digits than its factorization.
100101011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154476887 (or 154476874 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100101011112 its reverse (211110101001), we get a palindrome (311211112113).
The spelling of 100101011112 in words is "one hundred billion, one hundred one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •