Base | Representation |
---|---|
bin | 1100010000101… |
… | …01010101010110 |
3 | 21011112012200220 |
4 | 12020111111112 |
5 | 202312112310 |
6 | 14112215210 |
7 | 2356122621 |
oct | 610252526 |
9 | 234465626 |
10 | 102847830 |
11 | 53067108 |
12 | 2a53a506 |
13 | 183ccb07 |
14 | d932db8 |
15 | 9068670 |
hex | 6215556 |
102847830 has 64 divisors (see below), whose sum is σ = 256912128. Its totient is φ = 26328960.
The previous prime is 102847819. The next prime is 102847853. The reversal of 102847830 is 38748201.
It is a super-2 number, since 2×1028478302 = 21155352271417800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102847791 and 102847800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78037 + ... + 79343.
It is an arithmetic number, because the mean of its divisors is an integer number (4014252).
Almost surely, 2102847830 is an apocalyptic number.
102847830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102847830, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128456064).
102847830 is an abundant number, since it is smaller than the sum of its proper divisors (154064298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102847830 is a wasteful number, since it uses less digits than its factorization.
102847830 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1421.
The product of its (nonzero) digits is 10752, while the sum is 33.
The square root of 102847830 is about 10141.3919163002. The cubic root of 102847830 is about 468.5238582075.
The spelling of 102847830 in words is "one hundred two million, eight hundred forty-seven thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •