Base | Representation |
---|---|
bin | 101111000101000011… |
… | …1010100001000111000 |
3 | 100122221221011022222020 |
4 | 1132022013110020320 |
5 | 3124023430433422 |
6 | 114240110154440 |
7 | 10206246620526 |
oct | 1361207241070 |
9 | 318857138866 |
10 | 101101421112 |
11 | 3997113108a |
12 | 177167b2a20 |
13 | 96c2a6a203 |
14 | 4c7144d316 |
15 | 296aca195c |
hex | 178a1d4238 |
101101421112 has 32 divisors (see below), whose sum is σ = 252851258880. Its totient is φ = 33687446240.
The previous prime is 101101421111. The next prime is 101101421119. The reversal of 101101421112 is 211124101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101421091 and 101101421100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101421111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 750738 + ... + 875105.
It is an arithmetic number, because the mean of its divisors is an integer number (7901601840).
Almost surely, 2101101421112 is an apocalyptic number.
101101421112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101101421112 is an abundant number, since it is smaller than the sum of its proper divisors (151749837768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101421112 is a wasteful number, since it uses less digits than its factorization.
101101421112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1628443 (or 1628439 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101101421112 its reverse (211124101101), we get a palindrome (312225522213).
The spelling of 101101421112 in words is "one hundred one billion, one hundred one million, four hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •