Base | Representation |
---|---|
bin | 111100110100010… |
… | …010011100100101 |
3 | 2122002221122100120 |
4 | 330310102130211 |
5 | 4042201340010 |
6 | 245125232153 |
7 | 34166514126 |
oct | 7464223445 |
9 | 2562848316 |
10 | 1020340005 |
11 | 483a56603 |
12 | 245862659 |
13 | 13350c2a9 |
14 | 9972404d |
15 | 5e89ce70 |
hex | 3cd12725 |
1020340005 has 16 divisors (see below), whose sum is σ = 1645009344. Its totient is φ = 540026240.
The previous prime is 1020340003. The next prime is 1020340021. The reversal of 1020340005 is 5000430201.
1020340005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1020340005 - 21 = 1020340003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020340003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257664 + ... + 261593.
It is an arithmetic number, because the mean of its divisors is an integer number (102813084).
Almost surely, 21020340005 is an apocalyptic number.
1020340005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1020340005 is a deficient number, since it is larger than the sum of its proper divisors (624669339).
1020340005 is a wasteful number, since it uses less digits than its factorization.
1020340005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519396.
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 1020340005 is about 31942.7613865802. The cubic root of 1020340005 is about 1006.7345457471.
Adding to 1020340005 its reverse (5000430201), we get a palindrome (6020770206).
The spelling of 1020340005 in words is "one billion, twenty million, three hundred forty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •