Base | Representation |
---|---|
bin | 1010000001101100010001… |
… | …01001100011011110111111 |
3 | 2220001210200002122220221102 |
4 | 11000312020221203132333 |
5 | 10342220020042144431 |
6 | 114520513203523315 |
7 | 4433640623300555 |
oct | 500661051433677 |
9 | 86053602586842 |
10 | 22048359724991 |
11 | 70307252a0a96 |
12 | 258115308953b |
13 | c3c1c78202a2 |
14 | 563209661bd5 |
15 | 2837dd700dcb |
hex | 140d88a637bf |
22048359724991 has 16 divisors (see below), whose sum is σ = 22840105399200. Its totient is φ = 21258714892800.
The previous prime is 22048359724961. The next prime is 22048359725053. The reversal of 22048359724991 is 19942795384022.
It is a cyclic number.
It is not a de Polignac number, because 22048359724991 - 210 = 22048359723967 is a prime.
It is a super-3 number, since 3×220483597249913 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22048359724901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 551064995 + ... + 551105003.
It is an arithmetic number, because the mean of its divisors is an integer number (1427506587450).
Almost surely, 222048359724991 is an apocalyptic number.
22048359724991 is a deficient number, since it is larger than the sum of its proper divisors (791745674209).
22048359724991 is a wasteful number, since it uses less digits than its factorization.
22048359724991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65770.
The product of its (nonzero) digits is 78382080, while the sum is 65.
The spelling of 22048359724991 in words is "twenty-two trillion, forty-eight billion, three hundred fifty-nine million, seven hundred twenty-four thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •