Base | Representation |
---|---|
bin | 10101000101100100… |
… | …10000111011011001 |
3 | 1002012222111102001112 |
4 | 22202302100323121 |
5 | 141141140120441 |
6 | 5111212430105 |
7 | 550355040365 |
oct | 124262207331 |
9 | 32188442045 |
10 | 11321020121 |
11 | 488a469a84 |
12 | 223b478335 |
13 | 10b55a4c98 |
14 | 7957962a5 |
15 | 463d514eb |
hex | 2a2c90ed9 |
11321020121 has 4 divisors (see below), whose sum is σ = 11323407744. Its totient is φ = 11318632500.
The previous prime is 11321020111. The next prime is 11321020133. The reversal of 11321020121 is 12102012311.
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 11321020121 - 26 = 11321020057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11321020096 and 11321020105.
It is not an unprimeable number, because it can be changed into a prime (11321020111) 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, 1186685 + ... + 1196186.
It is an arithmetic number, because the mean of its divisors is an integer number (2830851936).
Almost surely, 211321020121 is an apocalyptic number.
It is an amenable number.
11321020121 is a deficient number, since it is larger than the sum of its proper divisors (2387623).
11321020121 is an equidigital number, since it uses as much as digits as its factorization.
11321020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2387622.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11321020121 its reverse (12102012311), we get a palindrome (23423032432).
It can be divided in two parts, 113210 and 20121, that added together give a palindrome (133331).
The spelling of 11321020121 in words is "eleven billion, three hundred twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •