Base | Representation |
---|---|
bin | 10100011111110100… |
… | …01111001101010001 |
3 | 1001101220121112212202 |
4 | 22033322033031101 |
5 | 140014102434441 |
6 | 5015541132545 |
7 | 536461242002 |
oct | 121772171521 |
9 | 31356545782 |
10 | 11004343121 |
11 | 4737734952 |
12 | 21713ba155 |
13 | 1064ab8445 |
14 | 7656c11a9 |
15 | 44614b19b |
hex | 28fe8f351 |
11004343121 has 4 divisors (see below), whose sum is σ = 11004567552. Its totient is φ = 11004118692.
The previous prime is 11004343111. The next prime is 11004343127. The reversal of 11004343121 is 12134340011.
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-11004343121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11004343093 and 11004343102.
It is not an unprimeable number, because it can be changed into a prime (11004343127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3665 + ... + 148398.
It is an arithmetic number, because the mean of its divisors is an integer number (2751141888).
Almost surely, 211004343121 is an apocalyptic number.
It is an amenable number.
11004343121 is a deficient number, since it is larger than the sum of its proper divisors (224431).
11004343121 is an equidigital number, since it uses as much as digits as its factorization.
11004343121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224430.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11004343121 its reverse (12134340011), we get a palindrome (23138683132).
The spelling of 11004343121 in words is "eleven billion, four million, three hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •