Base | Representation |
---|---|
bin | 111101000010010… |
… | …101001000001101 |
3 | 2122100212122201220 |
4 | 331002111020031 |
5 | 4044122133010 |
6 | 245340153553 |
7 | 34243014660 |
oct | 7502251015 |
9 | 2570778656 |
10 | 1024021005 |
11 | 486040157 |
12 | 246b388b9 |
13 | 1341ca8b7 |
14 | 9a0016d7 |
15 | 5ed78970 |
hex | 3d09520d |
1024021005 has 32 divisors (see below), whose sum is σ = 1898160384. Its totient is φ = 461707776.
The previous prime is 1024020997. The next prime is 1024021013. The reversal of 1024021005 is 5001204201.
It is an interprime number because it is at equal distance from previous prime (1024020997) and next prime (1024021013).
It is not a de Polignac number, because 1024021005 - 23 = 1024020997 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 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, 59134 + ... + 74463.
It is an arithmetic number, because the mean of its divisors is an integer number (59317512).
Almost surely, 21024021005 is an apocalyptic number.
1024021005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1024021005 is a deficient number, since it is larger than the sum of its proper divisors (874139379).
1024021005 is a wasteful number, since it uses less digits than its factorization.
1024021005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133685.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 1024021005 is about 32000.3282014419. The cubic root of 1024021005 is about 1007.9437317025.
Adding to 1024021005 its reverse (5001204201), we get a palindrome (6025225206).
The spelling of 1024021005 in words is "one billion, twenty-four million, twenty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •