Base | Representation |
---|---|
bin | 1010000000100110101110… |
… | …01110110111111110000011 |
3 | 2212221020022001211101111001 |
4 | 11000103113032313332003 |
5 | 10341112033444103121 |
6 | 114451420301232431 |
7 | 4431146452056316 |
oct | 500232716677603 |
9 | 85836261741431 |
10 | 22011023425411 |
11 | 7016905996559 |
12 | 2575a73262717 |
13 | c38827585027 |
14 | 5614a6b5897d |
15 | 2828559cd991 |
hex | 1404d73b7f83 |
22011023425411 has 4 divisors (see below), whose sum is σ = 22013396079232. Its totient is φ = 22008650771592.
The previous prime is 22011023425397. The next prime is 22011023425429. The reversal of 22011023425411 is 11452432011022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22011023425411 - 213 = 22011023417219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22011023425411.
It is not an unprimeable number, because it can be changed into a prime (22014023425411) 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, 1186312995 + ... + 1186331548.
It is an arithmetic number, because the mean of its divisors is an integer number (5503349019808).
Almost surely, 222011023425411 is an apocalyptic number.
22011023425411 is a deficient number, since it is larger than the sum of its proper divisors (2372653821).
22011023425411 is an equidigital number, since it uses as much as digits as its factorization.
22011023425411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2372653820.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 22011023425411 its reverse (11452432011022), we get a palindrome (33463455436433).
The spelling of 22011023425411 in words is "twenty-two trillion, eleven billion, twenty-three million, four hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •