Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100001011111110000 |
3 | 100122221222020202012200 |
4 | 1132022021201133300 |
5 | 3124024103000422 |
6 | 114240130423200 |
7 | 10206254551551 |
oct | 1361211413760 |
9 | 318858222180 |
10 | 101102000112 |
11 | 399714970a3 |
12 | 17716a31b00 |
13 | 96c2c10909 |
14 | 4c71560328 |
15 | 296ad682ac |
hex | 178a2617f0 |
101102000112 has 30 divisors (see below), whose sum is σ = 282945181272. Its totient is φ = 33700666656.
The previous prime is 101102000053. The next prime is 101102000147. The reversal of 101102000112 is 211000201101.
It is a happy number.
It is a super-2 number, since 2×1011020001122 (a number of 23 digits) contains 22 as substring.
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 = 101102000094 and 101102000103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 351048468 + ... + 351048755.
Almost surely, 2101102000112 is an apocalyptic number.
101102000112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101102000112 is an abundant number, since it is smaller than the sum of its proper divisors (181843181160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102000112 is a wasteful number, since it uses less digits than its factorization.
101102000112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 702097237 (or 702097228 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101102000112 its reverse (211000201101), we get a palindrome (312102201213).
The spelling of 101102000112 in words is "one hundred one billion, one hundred two million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •