Base | Representation |
---|---|
bin | 1010000000011101000010… |
… | …10100011011110000011001 |
3 | 2212220201212201002110021101 |
4 | 11000032201110123300121 |
5 | 10341020411412231003 |
6 | 114445200322311401 |
7 | 4430603555162434 |
oct | 500164124336031 |
9 | 85821781073241 |
10 | 22005823945753 |
11 | 7014687a2152a |
12 | 2574a61ab8561 |
13 | c381a92c1c4b |
14 | 5611323ac81b |
15 | 28264e2c211d |
hex | 1403a151bc19 |
22005823945753 has 2 divisors, whose sum is σ = 22005823945754. Its totient is φ = 22005823945752.
The previous prime is 22005823945727. The next prime is 22005823945801. The reversal of 22005823945753 is 35754932850022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21374320358169 + 631503587584 = 4623237^2 + 794672^2 .
It is a cyclic number.
It is not a de Polignac number, because 22005823945753 - 237 = 21868384992281 is a prime.
It is a super-2 number, since 2×220058239457532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22005823945694 and 22005823945703.
It is not a weakly prime, because it can be changed into another prime (22006823945753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11002911972876 + 11002911972877.
It is an arithmetic number, because the mean of its divisors is an integer number (11002911972877).
Almost surely, 222005823945753 is an apocalyptic number.
It is an amenable number.
22005823945753 is a deficient number, since it is larger than the sum of its proper divisors (1).
22005823945753 is an equidigital number, since it uses as much as digits as its factorization.
22005823945753 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144000, while the sum is 55.
The spelling of 22005823945753 in words is "twenty-two trillion, five billion, eight hundred twenty-three million, nine hundred forty-five thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •