Base | Representation |
---|---|
bin | 1010000000111011101010… |
… | …00111110010010101100101 |
3 | 2212222022022022202110212111 |
4 | 11000131311013302111211 |
5 | 10341303043122131203 |
6 | 114500515421321021 |
7 | 4432025121665446 |
oct | 500356507622545 |
9 | 85868268673774 |
10 | 22022262302053 |
11 | 7020652a4a962 |
12 | 257808b106171 |
13 | c398c8b290b0 |
14 | 561c5164b2cd |
15 | 282cb250626d |
hex | 1407751f2565 |
22022262302053 has 16 divisors (see below), whose sum is σ = 23839750675440. Its totient is φ = 20222417424384.
The previous prime is 22022262302023. The next prime is 22022262302077. The reversal of 22022262302053 is 35020326222022.
It can be written as a sum of positive squares in 8 ways, for example, as 3690018167364 + 18332244134689 = 1920942^2 + 4281617^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22022262302053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22022262302003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136441563 + ... + 136602871.
It is an arithmetic number, because the mean of its divisors is an integer number (1489984417215).
Almost surely, 222022262302053 is an apocalyptic number.
It is an amenable number.
22022262302053 is a deficient number, since it is larger than the sum of its proper divisors (1817488373387).
22022262302053 is a wasteful number, since it uses less digits than its factorization.
22022262302053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215928.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 22022262302053 its reverse (35020326222022), we get a palindrome (57042588524075).
The spelling of 22022262302053 in words is "twenty-two trillion, twenty-two billion, two hundred sixty-two million, three hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •