Base | Representation |
---|---|
bin | 1100010000110… |
… | …10111100011010 |
3 | 21011120101020000 |
4 | 12020122330122 |
5 | 202313331220 |
6 | 14112513430 |
7 | 2356246620 |
oct | 610327432 |
9 | 234511200 |
10 | 102870810 |
11 | 530823a9 |
12 | 2a54b876 |
13 | 1840a403 |
14 | d93b510 |
15 | 9070390 |
hex | 621af1a |
102870810 has 80 divisors (see below), whose sum is σ = 316141056. Its totient is φ = 23512032.
The previous prime is 102870809. The next prime is 102870811. The reversal of 102870810 is 18078201.
It is an interprime number because it is at equal distance from previous prime (102870809) and next prime (102870811).
It is a super-2 number, since 2×1028708102 = 21164807100112200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (102870811) 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 39 ways as a sum of consecutive naturals, for example, 3402 + ... + 14741.
Almost surely, 2102870810 is an apocalyptic number.
102870810 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102870810 is an abundant number, since it is smaller than the sum of its proper divisors (213270246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102870810 is a wasteful number, since it uses less digits than its factorization.
102870810 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18169 (or 18160 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 27.
The square root of 102870810 is about 10142.5248335905. The cubic root of 102870810 is about 468.5587507812.
The spelling of 102870810 in words is "one hundred two million, eight hundred seventy thousand, eight hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •