Base | Representation |
---|---|
bin | 1010000110110111101110… |
… | …00111000000110111111001 |
3 | 2220200210222112002210210002 |
4 | 11003123313013000313321 |
5 | 10403123433442203231 |
6 | 115134342503002345 |
7 | 4452540411626036 |
oct | 503336707006771 |
9 | 86623875083702 |
10 | 22226306600441 |
11 | 709a13a701319 |
12 | 25ab7351393b5 |
13 | c52c15ca9b28 |
14 | 56ba8a8d438d |
15 | 288255a510cb |
hex | 1436f71c0df9 |
22226306600441 has 2 divisors, whose sum is σ = 22226306600442. Its totient is φ = 22226306600440.
The previous prime is 22226306600327. The next prime is 22226306600501. The reversal of 22226306600441 is 14400660362222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21844135360441 + 382171240000 = 4673771^2 + 618200^2 .
It is a cyclic number.
It is not a de Polignac number, because 22226306600441 - 214 = 22226306584057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22226306600395 and 22226306600404.
It is not a weakly prime, because it can be changed into another prime (22226306605441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11113153300220 + 11113153300221.
It is an arithmetic number, because the mean of its divisors is an integer number (11113153300221).
Almost surely, 222226306600441 is an apocalyptic number.
It is an amenable number.
22226306600441 is a deficient number, since it is larger than the sum of its proper divisors (1).
22226306600441 is an equidigital number, since it uses as much as digits as its factorization.
22226306600441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 38.
Adding to 22226306600441 its reverse (14400660362222), we get a palindrome (36626966962663).
The spelling of 22226306600441 in words is "twenty-two trillion, two hundred twenty-six billion, three hundred six million, six hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •