Base | Representation |
---|---|
bin | 1001010010111000011110… |
… | …0001111100100001011101 |
3 | 1100012000121102222000202012 |
4 | 2110232013201330201131 |
5 | 2314421030230114442 |
6 | 33423000442241005 |
7 | 2103241103224046 |
oct | 224560741744135 |
9 | 40160542860665 |
10 | 10220001019997 |
11 | 329030716060a |
12 | 11908557b6165 |
13 | 59198511b672 |
14 | 2749176bd8cd |
15 | 12aca4285582 |
hex | 94b8787c85d |
10220001019997 has 2 divisors, whose sum is σ = 10220001019998. Its totient is φ = 10220001019996.
The previous prime is 10220001019993. The next prime is 10220001020017. The reversal of 10220001019997 is 79991010002201.
10220001019997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9796530663481 + 423470356516 = 3129941^2 + 650746^2 .
It is an emirp because it is prime and its reverse (79991010002201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10220001019997 - 22 = 10220001019993 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220001019993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110000509998 + 5110000509999.
It is an arithmetic number, because the mean of its divisors is an integer number (5110000509999).
Almost surely, 210220001019997 is an apocalyptic number.
It is an amenable number.
10220001019997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220001019997 is an equidigital number, since it uses as much as digits as its factorization.
10220001019997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412, while the sum is 41.
The spelling of 10220001019997 in words is "ten trillion, two hundred twenty billion, one million, nineteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •