Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …01111001001011011010001 |
3 | 2212220101121222102212101101 |
4 | 11000023023233021123101 |
5 | 10340441042044434322 |
6 | 114443404555304401 |
7 | 4430416014354301 |
oct | 500131357113321 |
9 | 85811558385341 |
10 | 22002240624337 |
11 | 7013109265076 |
12 | 2574221a4b101 |
13 | c37a57b0150c |
14 | 560cb2521601 |
15 | 2824de907327 |
hex | 1402cbbc96d1 |
22002240624337 has 2 divisors, whose sum is σ = 22002240624338. Its totient is φ = 22002240624336.
The previous prime is 22002240624193. The next prime is 22002240624361. The reversal of 22002240624337 is 73342604220022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21691831187601 + 310409436736 = 4657449^2 + 557144^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22002240624337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22002240624296 and 22002240624305.
It is not a weakly prime, because it can be changed into another prime (22002240627337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11001120312168 + 11001120312169.
It is an arithmetic number, because the mean of its divisors is an integer number (11001120312169).
Almost surely, 222002240624337 is an apocalyptic number.
It is an amenable number.
22002240624337 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002240624337 is an equidigital number, since it uses as much as digits as its factorization.
22002240624337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 37.
Adding to 22002240624337 its reverse (73342604220022), we get a palindrome (95344844844359).
The spelling of 22002240624337 in words is "twenty-two trillion, two billion, two hundred forty million, six hundred twenty-four thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •