Base | Representation |
---|---|
bin | 1100000010101… |
… | …01001010010000 |
3 | 21001001221120100 |
4 | 12001111022100 |
5 | 201324341422 |
6 | 14005012400 |
7 | 2334405645 |
oct | 601251220 |
9 | 231057510 |
10 | 101012112 |
11 | 52022993 |
12 | 299b4100 |
13 | 17c093a6 |
14 | d5b5dcc |
15 | 8d047ac |
hex | 6055290 |
101012112 has 30 divisors (see below), whose sum is σ = 282694022. Its totient is φ = 33670656.
The previous prime is 101012089. The next prime is 101012137. The reversal of 101012112 is 211210101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 77158656 + 23853456 = 8784^2 + 4884^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 = 101012094 and 101012103.
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, 350593 + ... + 350880.
Almost surely, 2101012112 is an apocalyptic number.
101012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101012112 is an abundant number, since it is smaller than the sum of its proper divisors (181681910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012112 is a wasteful number, since it uses less digits than its factorization.
101012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701487 (or 701478 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 101012112 is about 10050.4781975785. The cubic root of 101012112 is about 465.7195657786.
Adding to 101012112 its reverse (211210101), we get a palindrome (312222213).
It can be divided in two parts, 101012 and 112, that added together give a square (101124 = 3182).
The spelling of 101012112 in words is "one hundred one million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •