Base | Representation |
---|---|
bin | 1001010011000000010101… |
… | …0010111000010111111111 |
3 | 1100012020001111021010021001 |
4 | 2110300011102320113333 |
5 | 2314434340404000223 |
6 | 33423550054351131 |
7 | 2103344303605324 |
oct | 224600522702777 |
9 | 40166044233231 |
10 | 10222111000063 |
11 | 329119a195896 |
12 | 119114435b4a7 |
13 | 591c302c1c91 |
14 | 274a77a06b4b |
15 | 12ad7961e9ad |
hex | 94c054b85ff |
10222111000063 has 2 divisors, whose sum is σ = 10222111000064. Its totient is φ = 10222111000062.
The previous prime is 10222111000021. The next prime is 10222111000091. The reversal of 10222111000063 is 36000011122201.
10222111000063 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 10222111000063 - 225 = 10222077445631 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10222111000063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222111090063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111055500031 + 5111055500032.
It is an arithmetic number, because the mean of its divisors is an integer number (5111055500032).
Almost surely, 210222111000063 is an apocalyptic number.
10222111000063 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222111000063 is an equidigital number, since it uses as much as digits as its factorization.
10222111000063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10222111000063 its reverse (36000011122201), we get a palindrome (46222122122264).
The spelling of 10222111000063 in words is "ten trillion, two hundred twenty-two billion, one hundred eleven million, sixty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •