Base | Representation |
---|---|
bin | 10101100010100100… |
… | …10110111000010111 |
3 | 1002211221022000200221 |
4 | 22301102112320113 |
5 | 142140431023020 |
6 | 5151303215211 |
7 | 556401022363 |
oct | 126122267027 |
9 | 32757260627 |
10 | 11564314135 |
11 | 49a4832410 |
12 | 22a8a47507 |
13 | 1123b0a23a |
14 | 7b9c082a3 |
15 | 47a3ad6aa |
hex | 2b1496e17 |
11564314135 has 8 divisors (see below), whose sum is σ = 15138738576. Its totient is φ = 8410410240.
The previous prime is 11564314093. The next prime is 11564314213. The reversal of 11564314135 is 53141346511.
11564314135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11564314135 - 29 = 11564313623 is a prime.
It is a super-2 number, since 2×115643141352 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11564314135.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 105130074 + ... + 105130183.
It is an arithmetic number, because the mean of its divisors is an integer number (1892342322).
Almost surely, 211564314135 is an apocalyptic number.
11564314135 is a deficient number, since it is larger than the sum of its proper divisors (3574424441).
11564314135 is a wasteful number, since it uses less digits than its factorization.
11564314135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210260273.
The product of its digits is 21600, while the sum is 34.
The spelling of 11564314135 in words is "eleven billion, five hundred sixty-four million, three hundred fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •