Base | Representation |
---|---|
bin | 10110000000010111… |
… | …01001101111010101 |
3 | 1010111100112021201012 |
4 | 23000023221233111 |
5 | 143143414331423 |
6 | 5232151342005 |
7 | 565524111245 |
oct | 130013515725 |
9 | 33440467635 |
10 | 11814214613 |
11 | 50128a8333 |
12 | 2358681905 |
13 | 1163816546 |
14 | 801099b25 |
15 | 4922c3078 |
hex | 2c02e9bd5 |
11814214613 has 2 divisors, whose sum is σ = 11814214614. Its totient is φ = 11814214612.
The previous prime is 11814214579. The next prime is 11814214627. The reversal of 11814214613 is 31641241811.
11814214613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11251481329 + 562733284 = 106073^2 + 23722^2 .
It is a cyclic number.
It is not a de Polignac number, because 11814214613 - 210 = 11814213589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11814214613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11814234613) 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 as a sum of consecutive naturals, namely, 5907107306 + 5907107307.
It is an arithmetic number, because the mean of its divisors is an integer number (5907107307).
Almost surely, 211814214613 is an apocalyptic number.
It is an amenable number.
11814214613 is a deficient number, since it is larger than the sum of its proper divisors (1).
11814214613 is an equidigital number, since it uses as much as digits as its factorization.
11814214613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4608, while the sum is 32.
The spelling of 11814214613 in words is "eleven billion, eight hundred fourteen million, two hundred fourteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •