Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0111100111000100101001 |
3 | 1100012001011011101002221222 |
4 | 2110232110013213010221 |
5 | 2314421443312021301 |
6 | 33423033425111425 |
7 | 2103246246340064 |
oct | 224562407470451 |
9 | 40161134332858 |
10 | 10220212220201 |
11 | 32904053a3435 |
12 | 11908b4488575 |
13 | 5919b9ac78b9 |
14 | 2749377798db |
15 | 12acb7aa331b |
hex | 94b941e7129 |
10220212220201 has 2 divisors, whose sum is σ = 10220212220202. Its totient is φ = 10220212220200.
The previous prime is 10220212220191. The next prime is 10220212220269. The reversal of 10220212220201 is 10202221202201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10176731629801 + 43480590400 = 3190099^2 + 208520^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10220212220201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10220212220201.
It is not a weakly prime, because it can be changed into another prime (10220212222201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110106110100 + 5110106110101.
It is an arithmetic number, because the mean of its divisors is an integer number (5110106110101).
Almost surely, 210220212220201 is an apocalyptic number.
It is an amenable number.
10220212220201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220212220201 is an equidigital number, since it uses as much as digits as its factorization.
10220212220201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 10220212220201 its reverse (10202221202201), we get a palindrome (20422433422402).
The spelling of 10220212220201 in words is "ten trillion, two hundred twenty billion, two hundred twelve million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •