Base | Representation |
---|---|
bin | 10011000010010101… |
… | …00101101001101111 |
3 | 222101020220212211220 |
4 | 21201022211221233 |
5 | 131412321201312 |
6 | 4410044114423 |
7 | 511156263342 |
oct | 114112455157 |
9 | 28336825756 |
10 | 10220100207 |
11 | 4374a86609 |
12 | 1b92835a13 |
13 | c6b491695 |
14 | 6cd498459 |
15 | 3ec387c8c |
hex | 2612a5a6f |
10220100207 has 8 divisors (see below), whose sum is σ = 13943702784. Its totient is φ = 6654948888.
The previous prime is 10220100199. The next prime is 10220100223. The reversal of 10220100207 is 70200102201.
10220100207 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 not a de Polignac number, because 10220100207 - 23 = 10220100199 is a prime.
It is a super-2 number, since 2×102201002072 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220100257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39612663 + ... + 39612920.
It is an arithmetic number, because the mean of its divisors is an integer number (1742962848).
Almost surely, 210220100207 is an apocalyptic number.
10220100207 is a deficient number, since it is larger than the sum of its proper divisors (3723602577).
10220100207 is an equidigital number, since it uses as much as digits as its factorization.
10220100207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79225629.
The product of its (nonzero) digits is 56, while the sum is 15.
Adding to 10220100207 its reverse (70200102201), we get a palindrome (80420202408).
The spelling of 10220100207 in words is "ten billion, two hundred twenty million, one hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •