Base | Representation |
---|---|
bin | 11010010000000111100… |
… | …101110010100110000111 |
3 | 20101110110210212202020201 |
4 | 122100013211302212013 |
5 | 214024104441031044 |
6 | 3500430304311331 |
7 | 244223065455016 |
oct | 32200745624607 |
9 | 6343423782221 |
10 | 1804013611399 |
11 | 6360947202aa |
12 | 251768612547 |
13 | 10116b9211ac |
14 | 63459866a7d |
15 | 31dd70bb7d4 |
hex | 1a407972987 |
1804013611399 has 2 divisors, whose sum is σ = 1804013611400. Its totient is φ = 1804013611398.
The previous prime is 1804013611381. The next prime is 1804013611417. The reversal of 1804013611399 is 9931163104081.
It is a balanced prime because it is at equal distance from previous prime (1804013611381) and next prime (1804013611417).
It is an emirp because it is prime and its reverse (9931163104081) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1804013611399 - 211 = 1804013609351 is a prime.
It is a super-2 number, since 2×18040136113992 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1804013611349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 902006805699 + 902006805700.
It is an arithmetic number, because the mean of its divisors is an integer number (902006805700).
Almost surely, 21804013611399 is an apocalyptic number.
1804013611399 is a deficient number, since it is larger than the sum of its proper divisors (1).
1804013611399 is an equidigital number, since it uses as much as digits as its factorization.
1804013611399 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The spelling of 1804013611399 in words is "one trillion, eight hundred four billion, thirteen million, six hundred eleven thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •