Base | Representation |
---|---|
bin | 10101001000000100… |
… | …10011001111011011 |
3 | 1002021102222100120101 |
4 | 22210002103033123 |
5 | 141212023013430 |
6 | 5113242240231 |
7 | 551031263434 |
oct | 124402231733 |
9 | 32242870511 |
10 | 11342001115 |
11 | 48a029a345 |
12 | 22464b6077 |
13 | 10b9a3ca83 |
14 | 79849848b |
15 | 465ae7dca |
hex | 2a40933db |
11342001115 has 4 divisors (see below), whose sum is σ = 13610401344. Its totient is φ = 9073600888.
The previous prime is 11342001079. The next prime is 11342001119. The reversal of 11342001115 is 51110024311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 51110024311 = 61 ⋅837869251.
It is a cyclic number.
It is not a de Polignac number, because 11342001115 - 27 = 11342000987 is a prime.
It is a super-2 number, since 2×113420011152 (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 = 11342001092 and 11342001101.
It is not an unprimeable number, because it can be changed into a prime (11342001119) 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, 1134200107 + ... + 1134200116.
It is an arithmetic number, because the mean of its divisors is an integer number (3402600336).
Almost surely, 211342001115 is an apocalyptic number.
11342001115 is a deficient number, since it is larger than the sum of its proper divisors (2268400229).
11342001115 is an equidigital number, since it uses as much as digits as its factorization.
11342001115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2268400228.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 11342001115 its reverse (51110024311), we get a palindrome (62452025426).
The spelling of 11342001115 in words is "eleven billion, three hundred forty-two million, one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •