Base | Representation |
---|---|
bin | 1010000100011001101101… |
… | …10101111000111100011001 |
3 | 2220101201000120022120202220 |
4 | 11002030312311320330121 |
5 | 10400231220441214132 |
6 | 115031353123414253 |
7 | 4443445300010421 |
oct | 502146665707431 |
9 | 86351016276686 |
10 | 22141476507417 |
11 | 7067169296923 |
12 | 25971bb824389 |
13 | c47c17295307 |
14 | 567920485481 |
15 | 285e3d4dda2c |
hex | 142336d78f19 |
22141476507417 has 8 divisors (see below), whose sum is σ = 29553142881696. Its totient is φ = 14745397235712.
The previous prime is 22141476507389. The next prime is 22141476507439. The reversal of 22141476507417 is 71470567414122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-22141476507417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22141476507417.
It is not an unprimeable number, because it can be changed into a prime (22141476507817) 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 7 ways as a sum of consecutive naturals, for example, 3896772328 + ... + 3896778009.
It is an arithmetic number, because the mean of its divisors is an integer number (3694142860212).
Almost surely, 222141476507417 is an apocalyptic number.
It is an amenable number.
22141476507417 is a deficient number, since it is larger than the sum of its proper divisors (7411666374279).
22141476507417 is an equidigital number, since it uses as much as digits as its factorization.
22141476507417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7793551287.
The product of its (nonzero) digits is 2634240, while the sum is 51.
The spelling of 22141476507417 in words is "twenty-two trillion, one hundred forty-one billion, four hundred seventy-six million, five hundred seven thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •