Base | Representation |
---|---|
bin | 1010000010000101101001… |
… | …11001000100010111110101 |
3 | 2220010002211210120200202222 |
4 | 11001002310321010113311 |
5 | 10342430422121010003 |
6 | 114531045321212125 |
7 | 4434632413301351 |
oct | 501026471042765 |
9 | 86102753520688 |
10 | 22061986891253 |
11 | 7036488499771 |
12 | 2583916931045 |
13 | c40589b0ca8a |
14 | 563b3d406461 |
15 | 283d39c39c38 |
hex | 1410b4e445f5 |
22061986891253 has 2 divisors, whose sum is σ = 22061986891254. Its totient is φ = 22061986891252.
The previous prime is 22061986891193. The next prime is 22061986891361. The reversal of 22061986891253 is 35219868916022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16174215671524 + 5887771219729 = 4021718^2 + 2426473^2 .
It is a cyclic number.
It is not a de Polignac number, because 22061986891253 - 228 = 22061718455797 is a prime.
It is a super-2 number, since 2×220619868912532 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22061986890253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11030993445626 + 11030993445627.
It is an arithmetic number, because the mean of its divisors is an integer number (11030993445627).
Almost surely, 222061986891253 is an apocalyptic number.
It is an amenable number.
22061986891253 is a deficient number, since it is larger than the sum of its proper divisors (1).
22061986891253 is an equidigital number, since it uses as much as digits as its factorization.
22061986891253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 22394880, while the sum is 62.
The spelling of 22061986891253 in words is "twenty-two trillion, sixty-one billion, nine hundred eighty-six million, eight hundred ninety-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •