Base | Representation |
---|---|
bin | 1010001101110110010011… |
… | …01101101110001011111001 |
3 | 2221112201211120101011222011 |
4 | 11012323021231232023321 |
5 | 10421040444132223103 |
6 | 115440433354125521 |
7 | 4506055663040050 |
oct | 506731155561371 |
9 | 87481746334864 |
10 | 22466063164153 |
11 | 7181892a70244 |
12 | 262a0a71208a1 |
13 | c6c704ac65cb |
14 | 579512ad5397 |
15 | 28e5d9422d6d |
hex | 146ec9b6e2f9 |
22466063164153 has 4 divisors (see below), whose sum is σ = 25675500759040. Its totient is φ = 19256625569268.
The previous prime is 22466063164093. The next prime is 22466063164189. The reversal of 22466063164153 is 35146136066422.
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 22466063164153 - 229 = 22465526293241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22466063164097 and 22466063164106.
It is not an unprimeable number, because it can be changed into a prime (22466003164153) 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, 1604718797433 + ... + 1604718797446.
It is an arithmetic number, because the mean of its divisors is an integer number (6418875189760).
Almost surely, 222466063164153 is an apocalyptic number.
It is an amenable number.
22466063164153 is a deficient number, since it is larger than the sum of its proper divisors (3209437594887).
22466063164153 is an equidigital number, since it uses as much as digits as its factorization.
22466063164153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3209437594886.
The product of its (nonzero) digits is 3732480, while the sum is 49.
The spelling of 22466063164153 in words is "twenty-two trillion, four hundred sixty-six billion, sixty-three million, one hundred sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •