Base | Representation |
---|---|
bin | 10100101100110001… |
… | …10100001010101001 |
3 | 1001200111010000102220 |
4 | 22112120310022221 |
5 | 140224413201441 |
6 | 5034422344253 |
7 | 542251062255 |
oct | 122630641251 |
9 | 31614100386 |
10 | 11113022121 |
11 | 4793014003 |
12 | 21a188b089 |
13 | 108147a446 |
14 | 775cd1265 |
15 | 450967466 |
hex | 2966342a9 |
11113022121 has 4 divisors (see below), whose sum is σ = 14817362832. Its totient is φ = 7408681412.
The previous prime is 11113022101. The next prime is 11113022159. The reversal of 11113022121 is 12122031111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12122031111 = 3 ⋅4040677037.
It is a cyclic number.
It is not a de Polignac number, because 11113022121 - 26 = 11113022057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11113022121.
It is not an unprimeable number, because it can be changed into a prime (11113022101) 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, 1852170351 + ... + 1852170356.
It is an arithmetic number, because the mean of its divisors is an integer number (3704340708).
Almost surely, 211113022121 is an apocalyptic number.
It is an amenable number.
11113022121 is a deficient number, since it is larger than the sum of its proper divisors (3704340711).
11113022121 is an equidigital number, since it uses as much as digits as its factorization.
11113022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3704340710.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11113022121 its reverse (12122031111), we get a palindrome (23235053232).
The spelling of 11113022121 in words is "eleven billion, one hundred thirteen million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •