Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0000101101110111010 |
3 | 100122222200021101101100 |
4 | 1132022300011232322 |
5 | 3124034200010020 |
6 | 114241131232230 |
7 | 10206436516512 |
oct | 1361260055672 |
9 | 318880241340 |
10 | 101112110010 |
11 | 3997717188a |
12 | 1771a2a8676 |
13 | 96c50404c2 |
14 | 4c72a32842 |
15 | 296bbb3a90 |
hex | 178ac05bba |
101112110010 has 48 divisors (see below), whose sum is σ = 269996670216. Its totient is φ = 26234492544.
The previous prime is 101112109963. The next prime is 101112110027. The reversal of 101112110010 is 10011211101.
It can be written as a sum of positive squares in 4 ways, for example, as 99737850969 + 1374259041 = 315813^2 + 37071^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 = 101112109974 and 101112110001.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 15178669 + ... + 15185328.
Almost surely, 2101112110010 is an apocalyptic number.
101112110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101112110010 is an abundant number, since it is smaller than the sum of its proper divisors (168884560206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112110010 is a wasteful number, since it uses less digits than its factorization.
101112110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30364047 (or 30364044 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101112110010 its reverse (10011211101), we get a palindrome (111123321111).
The spelling of 101112110010 in words is "one hundred one billion, one hundred twelve million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •