Base | Representation |
---|---|
bin | 1010000111100111110110… |
… | …01101101010011011001101 |
3 | 2220210021200021002111221020 |
4 | 11003303323031222123031 |
5 | 10404034343141144031 |
6 | 115154254443024353 |
7 | 4454443621602543 |
oct | 503637315523315 |
9 | 86707607074836 |
10 | 22252145256141 |
11 | 70aa099980829 |
12 | 25b474650b0b9 |
13 | c554a31abc08 |
14 | 56d01c3c9d93 |
15 | 288c69184096 |
hex | 143cfb36a6cd |
22252145256141 has 4 divisors (see below), whose sum is σ = 29669527008192. Its totient is φ = 14834763504092.
The previous prime is 22252145256113. The next prime is 22252145256161. The reversal of 22252145256141 is 14165254125222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22252145256141 - 29 = 22252145255629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22252145256093 and 22252145256102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22252145256161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3708690876021 + ... + 3708690876026.
It is an arithmetic number, because the mean of its divisors is an integer number (7417381752048).
Almost surely, 222252145256141 is an apocalyptic number.
It is an amenable number.
22252145256141 is a deficient number, since it is larger than the sum of its proper divisors (7417381752051).
22252145256141 is an equidigital number, since it uses as much as digits as its factorization.
22252145256141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7417381752050.
The product of its digits is 384000, while the sum is 42.
The spelling of 22252145256141 in words is "twenty-two trillion, two hundred fifty-two billion, one hundred forty-five million, two hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •