Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1111110110010110000 |
3 | 100122221222110211211010 |
4 | 1132022021332302300 |
5 | 3124024120320422 |
6 | 114240133150520 |
7 | 10206255561450 |
oct | 1361211766260 |
9 | 318858424733 |
10 | 101102120112 |
11 | 39971569274 |
12 | 17716a8b440 |
13 | 96c2c53416 |
14 | 4c71591d60 |
15 | 296ad8db0c |
hex | 178a27ecb0 |
101102120112 has 80 divisors (see below), whose sum is σ = 316050342912. Its totient is φ = 27187123200.
The previous prime is 101102120101. The next prime is 101102120113. The reversal of 101102120112 is 211021201101.
It is a super-2 number, since 2×1011021201122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (101102120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8844264 + ... + 8855687.
Almost surely, 2101102120112 is an apocalyptic number.
101102120112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101102120112 is an abundant number, since it is smaller than the sum of its proper divisors (214948222800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102120112 is a wasteful number, since it uses less digits than its factorization.
101102120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17699986 (or 17699980 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101102120112 its reverse (211021201101), we get a palindrome (312123321213).
The spelling of 101102120112 in words is "one hundred one billion, one hundred two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •