Base | Representation |
---|---|
bin | 1010000000011011101111… |
… | …00110110011101100010001 |
3 | 2212220200001221020120212121 |
4 | 11000031313212303230101 |
5 | 10341012443233304223 |
6 | 114445003042454241 |
7 | 4430550326563216 |
oct | 500156746635421 |
9 | 85820057216777 |
10 | 22005124119313 |
11 | 7014358990575 |
12 | 25748a7664381 |
13 | c380c731386a |
14 | 5610a747bb0d |
15 | 28260cb3615d |
hex | 1403779b3b11 |
22005124119313 has 2 divisors, whose sum is σ = 22005124119314. Its totient is φ = 22005124119312.
The previous prime is 22005124119283. The next prime is 22005124119343. The reversal of 22005124119313 is 31391142150022.
It is a balanced prime because it is at equal distance from previous prime (22005124119283) and next prime (22005124119343).
It can be written as a sum of positive squares in only one way, i.e., 19518220351249 + 2486903768064 = 4417943^2 + 1576992^2 .
It is a cyclic number.
It is not a de Polignac number, because 22005124119313 - 213 = 22005124111121 is a prime.
It is not a weakly prime, because it can be changed into another prime (22005124119343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11002562059656 + 11002562059657.
It is an arithmetic number, because the mean of its divisors is an integer number (11002562059657).
Almost surely, 222005124119313 is an apocalyptic number.
It is an amenable number.
22005124119313 is a deficient number, since it is larger than the sum of its proper divisors (1).
22005124119313 is an equidigital number, since it uses as much as digits as its factorization.
22005124119313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 34.
Adding to 22005124119313 its reverse (31391142150022), we get a palindrome (53396266269335).
The spelling of 22005124119313 in words is "twenty-two trillion, five billion, one hundred twenty-four million, one hundred nineteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •