Base | Representation |
---|---|
bin | 10100110000001111… |
… | …10000101110011101 |
3 | 1001202111211122001002 |
4 | 22120013300232131 |
5 | 140304334343023 |
6 | 5041342000045 |
7 | 543053224043 |
oct | 123007605635 |
9 | 31674748032 |
10 | 11142106013 |
11 | 47a8479185 |
12 | 21ab576025 |
13 | 10874c144c |
14 | 779b02393 |
15 | 4532aeb28 |
hex | 2981f0b9d |
11142106013 has 4 divisors (see below), whose sum is σ = 11173142880. Its totient is φ = 11111069148.
The previous prime is 11142106007. The next prime is 11142106021. The reversal of 11142106013 is 31060124111.
It is a happy number.
11142106013 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11142106013 - 212 = 11142101917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11142106093) 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, 15517895 + ... + 15518612.
It is an arithmetic number, because the mean of its divisors is an integer number (2793285720).
Almost surely, 211142106013 is an apocalyptic number.
It is an amenable number.
11142106013 is a deficient number, since it is larger than the sum of its proper divisors (31036867).
11142106013 is an equidigital number, since it uses as much as digits as its factorization.
11142106013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31036866.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 11142106013 in words is "eleven billion, one hundred forty-two million, one hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •