Base | Representation |
---|---|
bin | 111100110111111… |
… | …100110111101111 |
3 | 2122011202102111121 |
4 | 330313330313233 |
5 | 4042423101312 |
6 | 245202001411 |
7 | 34210623424 |
oct | 7467746757 |
9 | 2564672447 |
10 | 1021300207 |
11 | 484551a64 |
12 | 246046267 |
13 | 133787365 |
14 | 998d3d4b |
15 | 5e9dc707 |
hex | 3cdfcdef |
1021300207 has 8 divisors (see below), whose sum is σ = 1039942800. Its totient is φ = 1002702144.
The previous prime is 1021300199. The next prime is 1021300249. The reversal of 1021300207 is 7020031201.
It is a happy number.
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 1021300207 - 23 = 1021300199 is a prime.
It is a super-2 number, since 2×10213002072 = 2086108225636485698, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021300607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37033 + ... + 58429.
It is an arithmetic number, because the mean of its divisors is an integer number (129992850).
Almost surely, 21021300207 is an apocalyptic number.
1021300207 is a deficient number, since it is larger than the sum of its proper divisors (18642593).
1021300207 is an equidigital number, since it uses as much as digits as its factorization.
1021300207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22265.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 1021300207 is about 31957.7878927813. The cubic root of 1021300207 is about 1007.0502462152.
Adding to 1021300207 its reverse (7020031201), we get a palindrome (8041331408).
The spelling of 1021300207 in words is "one billion, twenty-one million, three hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •