Base | Representation |
---|---|
bin | 1010000011110011101000… |
… | …01110000010011111110101 |
3 | 2220022202020201021002222122 |
4 | 11001321310032002133311 |
5 | 10344412333020133301 |
6 | 115014132254205325 |
7 | 4442122531401365 |
oct | 501716416023765 |
9 | 86282221232878 |
10 | 22121031411701 |
11 | 70595275a0902 |
12 | 25932547b3845 |
13 | c4600961a041 |
14 | 56694101a9a5 |
15 | 28564365281b |
hex | 141e743827f5 |
22121031411701 has 2 divisors, whose sum is σ = 22121031411702. Its totient is φ = 22121031411700.
The previous prime is 22121031411697. The next prime is 22121031411767. The reversal of 22121031411701 is 10711413012122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21857401536100 + 263629875601 = 4675190^2 + 513449^2 .
It is a cyclic number.
It is not a de Polignac number, because 22121031411701 - 22 = 22121031411697 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22121031411301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060515705850 + 11060515705851.
It is an arithmetic number, because the mean of its divisors is an integer number (11060515705851).
Almost surely, 222121031411701 is an apocalyptic number.
It is an amenable number.
22121031411701 is a deficient number, since it is larger than the sum of its proper divisors (1).
22121031411701 is an equidigital number, since it uses as much as digits as its factorization.
22121031411701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 22121031411701 its reverse (10711413012122), we get a palindrome (32832444423823).
The spelling of 22121031411701 in words is "twenty-two trillion, one hundred twenty-one billion, thirty-one million, four hundred eleven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.247 sec. • engine limits •