Base | Representation |
---|---|
bin | 1010000111010101010101… |
… | …0101111000101101010011 |
3 | 1110101011111201200021221121 |
4 | 2201311111111320231103 |
5 | 2424202004121130003 |
6 | 35352544102303111 |
7 | 2225321164252615 |
oct | 241652525705523 |
9 | 43334451607847 |
10 | 11121102130003 |
11 | 35a8484253678 |
12 | 12b7416727a97 |
13 | 62893ba56748 |
14 | 2a639b012db5 |
15 | 1444432b6cbd |
hex | a1d55578b53 |
11121102130003 has 4 divisors (see below), whose sum is σ = 11706423294760. Its totient is φ = 10535780965248.
The previous prime is 11121102129983. The next prime is 11121102130009. The reversal of 11121102130003 is 30003120112111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11121102130003 - 217 = 11121101998931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121102130009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 292660582350 + ... + 292660582387.
It is an arithmetic number, because the mean of its divisors is an integer number (2926605823690).
Almost surely, 211121102130003 is an apocalyptic number.
11121102130003 is a deficient number, since it is larger than the sum of its proper divisors (585321164757).
11121102130003 is an equidigital number, since it uses as much as digits as its factorization.
11121102130003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585321164756.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11121102130003 its reverse (30003120112111), we get a palindrome (41124222242114).
The spelling of 11121102130003 in words is "eleven trillion, one hundred twenty-one billion, one hundred two million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •