Base | Representation |
---|---|
bin | 1100000010101… |
… | …11000111001110 |
3 | 21001002100112120 |
4 | 12001113013032 |
5 | 201330120420 |
6 | 14005113410 |
7 | 2334441162 |
oct | 601270716 |
9 | 231070476 |
10 | 101020110 |
11 | 520289a4 |
12 | 299b8866 |
13 | 17c0cc19 |
14 | d5b8ca2 |
15 | 8d06d40 |
hex | 60571ce |
101020110 has 32 divisors (see below), whose sum is σ = 244680480. Its totient is φ = 26690688.
The previous prime is 101020097. The next prime is 101020111. The reversal of 101020110 is 11020101.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12177 + ... + 18716.
It is an arithmetic number, because the mean of its divisors is an integer number (7646265).
Almost surely, 2101020110 is an apocalyptic number.
101020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101020110 is an abundant number, since it is smaller than the sum of its proper divisors (143660370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020110 is a wasteful number, since it uses less digits than its factorization.
101020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31012.
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 101020110 is about 10050.8760812180. The cubic root of 101020110 is about 465.7318571323.
Adding to 101020110 its reverse (11020101), we get a palindrome (112040211).
Subtracting from 101020110 its reverse (11020101), we obtain a palindrome (90000009).
The spelling of 101020110 in words is "one hundred one million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •