Base | Representation |
---|---|
bin | 1010000000110111011101… |
… | …00010100101101101001001 |
3 | 2212222002110222010101002012 |
4 | 11000123232202211231021 |
5 | 10341233432111412131 |
6 | 114455503402545305 |
7 | 4431615144115430 |
oct | 500335642455511 |
9 | 85862428111065 |
10 | 22020004404041 |
11 | 701a6a4475746 |
12 | 257775ab08235 |
13 | c39629105477 |
14 | 561ab981c117 |
15 | 282bce19e52b |
hex | 1406ee8a5b49 |
22020004404041 has 16 divisors (see below), whose sum is σ = 26000526320640. Its totient is φ = 18249262813440.
The previous prime is 22020004404007. The next prime is 22020004404071. The reversal of 22020004404041 is 14040440002022.
It is a cyclic number.
It is not a de Polignac number, because 22020004404041 - 26 = 22020004403977 is a prime.
It is a super-3 number, since 3×220200044040413 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22020004403998 and 22020004404016.
It is not an unprimeable number, because it can be changed into a prime (22020004404001) 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, 44695076 + ... + 45185061.
It is an arithmetic number, because the mean of its divisors is an integer number (1625032895040).
Almost surely, 222020004404041 is an apocalyptic number.
It is an amenable number.
22020004404041 is a deficient number, since it is larger than the sum of its proper divisors (3980521916599).
22020004404041 is a wasteful number, since it uses less digits than its factorization.
22020004404041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89881304.
The product of its (nonzero) digits is 2048, while the sum is 23.
Adding to 22020004404041 its reverse (14040440002022), we get a palindrome (36060444406063).
The spelling of 22020004404041 in words is "twenty-two trillion, twenty billion, four million, four hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •