Base | Representation |
---|---|
bin | 11101001110011001001… |
… | …11101011011001110111 |
3 | 10112222220122211021001102 |
4 | 32213030213223121313 |
5 | 112423010021132211 |
6 | 2045145504520315 |
7 | 132356013001013 |
oct | 16471447533167 |
9 | 3488818737042 |
10 | 1004160333431 |
11 | 357953369a92 |
12 | 14274332009b |
13 | 738cc1966b8 |
14 | 3685cbb5543 |
15 | 1b1c1b0ca3b |
hex | e9cc9eb677 |
1004160333431 has 2 divisors, whose sum is σ = 1004160333432. Its totient is φ = 1004160333430.
The previous prime is 1004160333403. The next prime is 1004160333437. The reversal of 1004160333431 is 1343330614001.
It is a strong prime.
It is an emirp because it is prime and its reverse (1343330614001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1004160333431 - 234 = 986980464247 is a prime.
It is a super-2 number, since 2×10041603334312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1004160333394 and 1004160333403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1004160333437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502080166715 + 502080166716.
It is an arithmetic number, because the mean of its divisors is an integer number (502080166716).
Almost surely, 21004160333431 is an apocalyptic number.
1004160333431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004160333431 is an equidigital number, since it uses as much as digits as its factorization.
1004160333431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 1004160333431 its reverse (1343330614001), we get a palindrome (2347490947432).
The spelling of 1004160333431 in words is "one trillion, four billion, one hundred sixty million, three hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •