Base | Representation |
---|---|
bin | 111100000010100… |
… | …010110110110101 |
3 | 2121012102010212012 |
4 | 330002202312311 |
5 | 4030332100041 |
6 | 243541534005 |
7 | 33650623520 |
oct | 7402426665 |
9 | 2535363765 |
10 | 1007300021 |
11 | 47765a462 |
12 | 241414305 |
13 | 1308c4b20 |
14 | 97acbbb7 |
15 | 5d6743eb |
hex | 3c0a2db5 |
1007300021 has 8 divisors (see below), whose sum is σ = 1239753984. Its totient is φ = 796984560.
The previous prime is 1007299999. The next prime is 1007300039. The reversal of 1007300021 is 1200037001.
1007300021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1007300021 - 210 = 1007298997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1007299969 and 1007300005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1007300051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5534525 + ... + 5534706.
It is an arithmetic number, because the mean of its divisors is an integer number (154969248).
Almost surely, 21007300021 is an apocalyptic number.
It is an amenable number.
1007300021 is a deficient number, since it is larger than the sum of its proper divisors (232453963).
1007300021 is a wasteful number, since it uses less digits than its factorization.
1007300021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11069251.
The product of its (nonzero) digits is 42, while the sum is 14.
The square root of 1007300021 is about 31737.9901852654. The cubic root of 1007300021 is about 1002.4274430855.
Adding to 1007300021 its reverse (1200037001), we get a palindrome (2207337022).
The spelling of 1007300021 in words is "one billion, seven million, three hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •