Base | Representation |
---|---|
bin | 11101001111001000001… |
… | …00101000010101101011 |
3 | 10120000221002012101100222 |
4 | 32213210010220111223 |
5 | 112424311233032034 |
6 | 2045252522120255 |
7 | 132401531256011 |
oct | 16474404502553 |
9 | 3500832171328 |
10 | 1004553799019 |
11 | 358035481561 |
12 | 14283305008b |
13 | 7396285a984 |
14 | 368991588b1 |
15 | 1b1e643012e |
hex | e9e412856b |
1004553799019 has 2 divisors, whose sum is σ = 1004553799020. Its totient is φ = 1004553799018.
The previous prime is 1004553798973. The next prime is 1004553799033. The reversal of 1004553799019 is 9109973554001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1004553799019 is a prime.
It is a super-2 number, since 2×10045537990192 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1004553796019) 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, 502276899509 + 502276899510.
It is an arithmetic number, because the mean of its divisors is an integer number (502276899510).
Almost surely, 21004553799019 is an apocalyptic number.
1004553799019 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004553799019 is an equidigital number, since it uses as much as digits as its factorization.
1004553799019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1530900, while the sum is 53.
The spelling of 1004553799019 in words is "one trillion, four billion, five hundred fifty-three million, seven hundred ninety-nine thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •