Base | Representation |
---|---|
bin | 10101000101101101… |
… | …10110101000010001 |
3 | 1002020001202112021002 |
4 | 22202312312220101 |
5 | 141141442114441 |
6 | 5111254311345 |
7 | 550401210566 |
oct | 124266665021 |
9 | 32201675232 |
10 | 11322223121 |
11 | 48901108a0 |
12 | 223b958555 |
13 | 10b5906711 |
14 | 7959ca86d |
15 | 463edcb9b |
hex | 2a2db6a11 |
11322223121 has 4 divisors (see below), whose sum is σ = 12351516144. Its totient is φ = 10292930100.
The previous prime is 11322223079. The next prime is 11322223153. The reversal of 11322223121 is 12132222311.
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 a de Polignac number, because none of the positive numbers 2k-11322223121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11322223093 and 11322223102.
It is not an unprimeable number, because it can be changed into a prime (11322223921) 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, 514646495 + ... + 514646516.
It is an arithmetic number, because the mean of its divisors is an integer number (3087879036).
Almost surely, 211322223121 is an apocalyptic number.
11322223121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11322223121 is a deficient number, since it is larger than the sum of its proper divisors (1029293023).
11322223121 is a wasteful number, since it uses less digits than its factorization.
11322223121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1029293022.
The product of its digits is 288, while the sum is 20.
Adding to 11322223121 its reverse (12132222311), we get a palindrome (23454445432).
The spelling of 11322223121 in words is "eleven billion, three hundred twenty-two million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •