Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0110101000111001001111 |
3 | 1100012000220010110221112002 |
4 | 2110232032012220321033 |
5 | 2314421241443132343 |
6 | 33423015422102515 |
7 | 2103243612502424 |
oct | 224561606507117 |
9 | 40160803427462 |
10 | 10220111302223 |
11 | 3290363435249 |
12 | 119088671aa3b |
13 | 5919a1c22314 |
14 | 2749281c9d4b |
15 | 12acadcbb8b8 |
hex | 94b8e1a8e4f |
10220111302223 has 2 divisors, whose sum is σ = 10220111302224. Its totient is φ = 10220111302222.
The previous prime is 10220111302147. The next prime is 10220111302267. The reversal of 10220111302223 is 32220311102201.
10220111302223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10220111302223 - 210 = 10220111301199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220111302195 and 10220111302204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220111302273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110055651111 + 5110055651112.
It is an arithmetic number, because the mean of its divisors is an integer number (5110055651112).
Almost surely, 210220111302223 is an apocalyptic number.
10220111302223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220111302223 is an equidigital number, since it uses as much as digits as its factorization.
10220111302223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10220111302223 its reverse (32220311102201), we get a palindrome (42440422404424).
The spelling of 10220111302223 in words is "ten trillion, two hundred twenty billion, one hundred eleven million, three hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •