Base | Representation |
---|---|
bin | 1010000000010110000000… |
… | …10010100011111100000001 |
3 | 2212220101010121002001222011 |
4 | 11000023000102203330001 |
5 | 10340440143414101002 |
6 | 114443333535212521 |
7 | 4430411163130264 |
oct | 500130022437401 |
9 | 85811117061864 |
10 | 22002048581377 |
11 | 701301a917387 |
12 | 2574189677141 |
13 | c37a270a1c27 |
14 | 560c94c10cdb |
15 | 2824ccb208d7 |
hex | 1402c04a3f01 |
22002048581377 has 2 divisors, whose sum is σ = 22002048581378. Its totient is φ = 22002048581376.
The previous prime is 22002048581333. The next prime is 22002048581407. The reversal of 22002048581377 is 77318584020022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16996622308416 + 5005426272961 = 4122696^2 + 2237281^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002048581377 - 243 = 13205955559169 is a prime.
It is a super-2 number, since 2×220020485813772 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22002048581377.
It is not a weakly prime, because it can be changed into another prime (22002048581327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11001024290688 + 11001024290689.
It is an arithmetic number, because the mean of its divisors is an integer number (11001024290689).
Almost surely, 222002048581377 is an apocalyptic number.
It is an amenable number.
22002048581377 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002048581377 is an equidigital number, since it uses as much as digits as its factorization.
22002048581377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1505280, while the sum is 49.
The spelling of 22002048581377 in words is "twenty-two trillion, two billion, forty-eight million, five hundred eighty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •