Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00001100110010001 |
3 | 1001102101022222212010 |
4 | 22100110001212101 |
5 | 140022320244441 |
6 | 5020342053133 |
7 | 536602555314 |
oct | 122024014621 |
9 | 31371288763 |
10 | 11011103121 |
11 | 4740531827 |
12 | 217371a1a9 |
13 | 1066314345 |
14 | 76656097b |
15 | 446a34116 |
hex | 290501991 |
11011103121 has 4 divisors (see below), whose sum is σ = 14681470832. Its totient is φ = 7340735412.
The previous prime is 11011103111. The next prime is 11011103189. The reversal of 11011103121 is 12130111011.
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 11011103121 - 26 = 11011103057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11011103097 and 11011103106.
It is not an unprimeable number, because it can be changed into a prime (11011103101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1835183851 + ... + 1835183856.
It is an arithmetic number, because the mean of its divisors is an integer number (3670367708).
Almost surely, 211011103121 is an apocalyptic number.
It is an amenable number.
11011103121 is a deficient number, since it is larger than the sum of its proper divisors (3670367711).
11011103121 is an equidigital number, since it uses as much as digits as its factorization.
11011103121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3670367710.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 11011103121 its reverse (12130111011), we get a palindrome (23141214132).
The spelling of 11011103121 in words is "eleven billion, eleven million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •