Base | Representation |
---|---|
bin | 1010000001101111011010… |
… | …10110101100011000010001 |
3 | 2220001222000211212012000112 |
4 | 11000313231112230120101 |
5 | 10342232000103421010 |
6 | 114521353000531105 |
7 | 4434030530256512 |
oct | 500675526543021 |
9 | 86058024765015 |
10 | 22050049279505 |
11 | 7031411a7a335 |
12 | 2581544a80a95 |
13 | c3c4068802a0 |
14 | 563329bc8a09 |
15 | 28388bbdea05 |
hex | 140ded5ac611 |
22050049279505 has 16 divisors (see below), whose sum is σ = 28789215816144. Its totient is φ = 16115246161920.
The previous prime is 22050049279501. The next prime is 22050049279541. The reversal of 22050049279505 is 50597294005022.
It is a Cunningham number, because it is equal to 46957482+1.
It can be written as a sum of positive squares in 8 ways, for example, as 5683436928016 + 16366612351489 = 2383996^2 + 4045567^2 .
It is not a de Polignac number, because 22050049279505 - 22 = 22050049279501 is a prime.
It is a super-2 number, since 2×220500492795052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22050049279501) 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, 1748609816 + ... + 1748622425.
It is an arithmetic number, because the mean of its divisors is an integer number (1799325988509).
Almost surely, 222050049279505 is an apocalyptic number.
It is an amenable number.
22050049279505 is a deficient number, since it is larger than the sum of its proper divisors (6739166536639).
22050049279505 is a wasteful number, since it uses less digits than its factorization.
22050049279505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3497232356.
The product of its (nonzero) digits is 2268000, while the sum is 50.
The spelling of 22050049279505 in words is "twenty-two trillion, fifty billion, forty-nine million, two hundred seventy-nine thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •