Base | Representation |
---|---|
bin | 1100010101000… |
… | …01001110011110 |
3 | 21012121022201010 |
4 | 12022201032132 |
5 | 202433431310 |
6 | 14132400050 |
7 | 2364030312 |
oct | 612411636 |
9 | 235538633 |
10 | 103420830 |
11 | 53418667 |
12 | 2a776026 |
13 | 18570876 |
14 | da41b42 |
15 | 912d320 |
hex | 62a139e |
103420830 has 32 divisors (see below), whose sum is σ = 249609600. Its totient is φ = 27423392.
The previous prime is 103420829. The next prime is 103420831. The reversal of 103420830 is 38024301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (103420829) and next prime (103420831).
It is a junction number, because it is equal to n+sod(n) for n = 103420797 and 103420806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103420831) 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, 4260 + ... + 14999.
It is an arithmetic number, because the mean of its divisors is an integer number (7800300).
Almost surely, 2103420830 is an apocalyptic number.
103420830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103420830 is an abundant number, since it is smaller than the sum of its proper divisors (146188770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103420830 is a wasteful number, since it uses less digits than its factorization.
103420830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19448.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 103420830 is about 10169.6032370983. The cubic root of 103420830 is about 469.3923488700.
The spelling of 103420830 in words is "one hundred three million, four hundred twenty thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •