Base | Representation |
---|---|
bin | 1100001011110… |
… | …01101001010010 |
3 | 21010022210221101 |
4 | 12011321221102 |
5 | 202131211010 |
6 | 14050415014 |
7 | 2350525501 |
oct | 605715122 |
9 | 233283841 |
10 | 102210130 |
11 | 52770a90 |
12 | 2a29146a |
13 | 18238789 |
14 | d808838 |
15 | 8e8e73a |
hex | 6179a52 |
102210130 has 64 divisors (see below), whose sum is σ = 208365696. Its totient is φ = 35776000.
The previous prime is 102210127. The next prime is 102210133. The reversal of 102210130 is 31012201.
It is an interprime number because it is at equal distance from previous prime (102210127) and next prime (102210133).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (102210133) 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 31 ways as a sum of consecutive naturals, for example, 590724 + ... + 590896.
It is an arithmetic number, because the mean of its divisors is an integer number (3255714).
Almost surely, 2102210130 is an apocalyptic number.
102210130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102210130 is an abundant number, since it is smaller than the sum of its proper divisors (106155566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102210130 is a wasteful number, since it uses less digits than its factorization.
102210130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 102210130 is about 10109.9025712417. The cubic root of 102210130 is about 467.5535012693.
Adding to 102210130 its reverse (31012201), we get a palindrome (133222331).
The spelling of 102210130 in words is "one hundred two million, two hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •