Base | Representation |
---|---|
bin | 10101000101101110… |
… | …01110110011001001 |
3 | 1002020001221120001202 |
4 | 22202313032303021 |
5 | 141142003301441 |
6 | 5111300353545 |
7 | 550402102325 |
oct | 124267166311 |
9 | 32201846052 |
10 | 11322322121 |
11 | 4890179210 |
12 | 223b9a58b5 |
13 | 10b593c7b6 |
14 | 795a14985 |
15 | 46400c19b |
hex | 2a2dcecc9 |
11322322121 has 4 divisors (see below), whose sum is σ = 12351624144. Its totient is φ = 10293020100.
The previous prime is 11322322087. The next prime is 11322322127. The reversal of 11322322121 is 12122322311.
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 de Polignac number, because none of the positive numbers 2k-11322322121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11322322093 and 11322322102.
It is not an unprimeable number, because it can be changed into a prime (11322322127) 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, 514650995 + ... + 514651016.
It is an arithmetic number, because the mean of its divisors is an integer number (3087906036).
Almost surely, 211322322121 is an apocalyptic number.
11322322121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11322322121 is a deficient number, since it is larger than the sum of its proper divisors (1029302023).
11322322121 is a wasteful number, since it uses less digits than its factorization.
11322322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1029302022.
The product of its digits is 288, while the sum is 20.
Adding to 11322322121 its reverse (12122322311), we get a palindrome (23444644432).
The spelling of 11322322121 in words is "eleven billion, three hundred twenty-two million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •