Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0110110000000100000 |
3 | 100122200212112012101222 |
4 | 1132010010312000200 |
5 | 3123322012010422 |
6 | 114222050514212 |
7 | 10203606525266 |
oct | 1360404660040 |
9 | 318625465358 |
10 | 101000110112 |
11 | 39919a24690 |
12 | 176a8895968 |
13 | 96a7a87a85 |
14 | 4c61bda436 |
15 | 2961e3d842 |
hex | 1784136020 |
101000110112 has 48 divisors (see below), whose sum is σ = 218376648000. Its totient is φ = 45601002240.
The previous prime is 101000110109. The next prime is 101000110147. The reversal of 101000110112 is 211011000101.
It is a happy number.
It is a super-2 number, since 2×1010001101122 (a number of 23 digits) contains 22 as substring.
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 101000110112.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 910412 + ... + 1015307.
It is an arithmetic number, because the mean of its divisors is an integer number (4549513500).
Almost surely, 2101000110112 is an apocalyptic number.
It is an amenable number.
101000110112 is an abundant number, since it is smaller than the sum of its proper divisors (117376537888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000110112 is a wasteful number, since it uses less digits than its factorization.
101000110112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1925889 (or 1925881 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 101000110112 its reverse (211011000101), we get a palindrome (312011110213).
It can be divided in two parts, 101000 and 110112, that added together give a palindrome (211112).
The spelling of 101000110112 in words is "one hundred one billion, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •