Base | Representation |
---|---|
bin | 1010000000010100111011… |
… | …00101110000010000100110 |
3 | 2212220022122000121201000010 |
4 | 11000022131211300100212 |
5 | 10340433000400110042 |
6 | 114443200101231050 |
7 | 4430360563554561 |
oct | 500123545602046 |
9 | 85808560551003 |
10 | 22001466410022 |
11 | 7012851236430 |
12 | 2574046702486 |
13 | c379635a9338 |
14 | 560c3b7894d8 |
15 | 28249697559c |
hex | 14029d970426 |
22001466410022 has 64 divisors (see below), whose sum is σ = 49717673510400. Its totient is φ = 6429537703680.
The previous prime is 22001466410009. The next prime is 22001466410029.
22001466410022 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001466410029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5244583 + ... + 8456274.
It is an arithmetic number, because the mean of its divisors is an integer number (776838648600).
Almost surely, 222001466410022 is an apocalyptic number.
22001466410022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22001466410022 is an abundant number, since it is smaller than the sum of its proper divisors (27716207100378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001466410022 is a wasteful number, since it uses less digits than its factorization.
22001466410022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13701741.
The product of its (nonzero) digits is 9216, while the sum is 30.
It can be divided in two parts, 2200146 and 6410022, that added together give a palindrome (8610168).
The spelling of 22001466410022 in words is "twenty-two trillion, one billion, four hundred sixty-six million, four hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •