Base | Representation |
---|---|
bin | 10101000111111101… |
… | …11100001000001001 |
3 | 1002021101022120220211 |
4 | 22203332330020021 |
5 | 141211311320014 |
6 | 5113211321121 |
7 | 551020633552 |
oct | 124376741011 |
9 | 32241276824 |
10 | 11341120009 |
11 | 489a84835a |
12 | 22461501a1 |
13 | 10b97c19cb |
14 | 798309329 |
15 | 4659c1cc4 |
hex | 2a3fbc209 |
11341120009 has 4 divisors (see below), whose sum is σ = 11647636804. Its totient is φ = 11034603216.
The previous prime is 11341119967. The next prime is 11341120033. The reversal of 11341120009 is 90002114311.
11341120009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4694305225 + 6646814784 = 68515^2 + 81528^2 .
It is a cyclic number.
It is not a de Polignac number, because 11341120009 - 233 = 2751185417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11341120039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153258342 + ... + 153258415.
It is an arithmetic number, because the mean of its divisors is an integer number (2911909201).
Almost surely, 211341120009 is an apocalyptic number.
It is an amenable number.
11341120009 is a deficient number, since it is larger than the sum of its proper divisors (306516795).
11341120009 is an equidigital number, since it uses as much as digits as its factorization.
11341120009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306516794.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 11341120009 in words is "eleven billion, three hundred forty-one million, one hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •