Base | Representation |
---|---|
bin | 10100100000110000… |
… | …01101101010100001 |
3 | 1001102110101210000210 |
4 | 22100120031222201 |
5 | 140023110413441 |
6 | 5020421404333 |
7 | 536615110425 |
oct | 122030155241 |
9 | 31373353023 |
10 | 11012201121 |
11 | 4741111769 |
12 | 2173b696a9 |
13 | 106660a04c |
14 | 766768b85 |
15 | 446b9e616 |
hex | 29060daa1 |
11012201121 has 4 divisors (see below), whose sum is σ = 14682934832. Its totient is φ = 7341467412.
The previous prime is 11012201113. The next prime is 11012201131. The reversal of 11012201121 is 12110221011.
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 not a de Polignac number, because 11012201121 - 23 = 11012201113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012201097 and 11012201106.
It is not an unprimeable number, because it can be changed into a prime (11012201131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1835366851 + ... + 1835366856.
It is an arithmetic number, because the mean of its divisors is an integer number (3670733708).
Almost surely, 211012201121 is an apocalyptic number.
It is an amenable number.
11012201121 is a deficient number, since it is larger than the sum of its proper divisors (3670733711).
11012201121 is an equidigital number, since it uses as much as digits as its factorization.
11012201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3670733710.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012201121 its reverse (12110221011), we get a palindrome (23122422132).
The spelling of 11012201121 in words is "eleven billion, twelve million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •