Base | Representation |
---|---|
bin | 10100110000001110… |
… | …11010000001010101 |
3 | 1001202111122220110122 |
4 | 22120013122001111 |
5 | 140304323404023 |
6 | 5041340001325 |
7 | 543052355645 |
oct | 123007320125 |
9 | 31674586418 |
10 | 11142013013 |
11 | 47a841531a |
12 | 21ab530245 |
13 | 108748b011 |
14 | 779aba525 |
15 | 4532922c8 |
hex | 2981da055 |
11142013013 has 4 divisors (see below), whose sum is σ = 11222171520. Its totient is φ = 11061854508.
The previous prime is 11142013007. The next prime is 11142013153. The reversal of 11142013013 is 31031024111.
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 11142013013 - 24 = 11142012997 is a prime.
It is a super-2 number, since 2×111420130132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11142012982 and 11142013000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11142013213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40079045 + ... + 40079322.
It is an arithmetic number, because the mean of its divisors is an integer number (2805542880).
Almost surely, 211142013013 is an apocalyptic number.
It is an amenable number.
11142013013 is a deficient number, since it is larger than the sum of its proper divisors (80158507).
11142013013 is an equidigital number, since it uses as much as digits as its factorization.
11142013013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80158506.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11142013013 its reverse (31031024111), we get a palindrome (42173037124).
The spelling of 11142013013 in words is "eleven billion, one hundred forty-two million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •