Base | Representation |
---|---|
bin | 1100001010010… |
… | …01000100000100 |
3 | 21002221200222101 |
4 | 12011021010010 |
5 | 202103324030 |
6 | 14042241444 |
7 | 2346036400 |
oct | 605110404 |
9 | 232850871 |
10 | 102011140 |
11 | 52645530 |
12 | 2a1b6284 |
13 | 1819902a |
14 | d796100 |
15 | 8e507ca |
hex | 6149104 |
102011140 has 72 divisors (see below), whose sum is σ = 271881792. Its totient is φ = 31792320.
The previous prime is 102011113. The next prime is 102011191. The reversal of 102011140 is 41110201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6049 + ... + 15511.
It is an arithmetic number, because the mean of its divisors is an integer number (3776136).
Almost surely, 2102011140 is an apocalyptic number.
102011140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102011140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135940896).
102011140 is an abundant number, since it is smaller than the sum of its proper divisors (169870652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011140 is a wasteful number, since it uses less digits than its factorization.
102011140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9497 (or 9488 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 102011140 is about 10100.0564354859. The cubic root of 102011140 is about 467.2498819359.
Adding to 102011140 its reverse (41110201), we get a palindrome (143121341).
The spelling of 102011140 in words is "one hundred two million, eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •