Base | Representation |
---|---|
bin | 100111101110… |
… | …1100101000010 |
3 | 1110012022010010 |
4 | 1033131211002 |
5 | 20313034110 |
6 | 2022245350 |
7 | 342025260 |
oct | 117354502 |
9 | 43168103 |
10 | 20830530 |
11 | 10838316 |
12 | 6b86856 |
13 | 4414476 |
14 | 2aa3430 |
15 | 1c67020 |
hex | 13dd942 |
20830530 has 64 divisors (see below), whose sum is σ = 57500928. Its totient is φ = 4730880.
The previous prime is 20830529. The next prime is 20830547. The reversal of 20830530 is 3503802.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 20830497 and 20830506.
It is an unprimeable number.
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, 58834 + ... + 59186.
It is an arithmetic number, because the mean of its divisors is an integer number (898452).
Almost surely, 220830530 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20830530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28750464).
20830530 is an abundant number, since it is smaller than the sum of its proper divisors (36670398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20830530 is a wasteful number, since it uses less digits than its factorization.
20830530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 20830530 is about 4564.0475457646. The cubic root of 20830530 is about 275.1482616506.
It can be divided in two parts, 208305 and 30, that added together give a triangular number (208335 = T645).
The spelling of 20830530 in words is "twenty million, eight hundred thirty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •