Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0111100010001001000001 |
3 | 1100012001011011100002020211 |
4 | 2110232110013202021001 |
5 | 2314421443310400001 |
6 | 33423033424434121 |
7 | 2103246246224146 |
oct | 224562407421101 |
9 | 40161134302224 |
10 | 10220212200001 |
11 | 329040538a241 |
12 | 11908b4478941 |
13 | 5919b9abb64b |
14 | 2749377723cd |
15 | 12acb7a9c351 |
hex | 94b941e2241 |
10220212200001 has 8 divisors (see below), whose sum is σ = 10343630596320. Its totient is φ = 10096800549312.
The previous prime is 10220212199971. The next prime is 10220212200043. The reversal of 10220212200001 is 10000221202201.
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 10220212200001 - 25 = 10220212199969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220212000001) 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, 1395870 + ... + 4731688.
It is an arithmetic number, because the mean of its divisors is an integer number (1292953824540).
Almost surely, 210220212200001 is an apocalyptic number.
It is an amenable number.
10220212200001 is a deficient number, since it is larger than the sum of its proper divisors (123418396319).
10220212200001 is an equidigital number, since it uses as much as digits as its factorization.
10220212200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3372815.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10220212200001 its reverse (10000221202201), we get a palindrome (20220433402202).
The spelling of 10220212200001 in words is "ten trillion, two hundred twenty billion, two hundred twelve million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •