Base | Representation |
---|---|
bin | 11101001000101101011… |
… | …00000000001110000111 |
3 | 10112201000221100100220002 |
4 | 32210112230000032013 |
5 | 112400232122421314 |
6 | 2043522551031515 |
7 | 132220250500304 |
oct | 16442654001607 |
9 | 3481027310802 |
10 | 1001108013959 |
11 | 356627414209 |
12 | 14203106b59b |
13 | 735339c40c1 |
14 | 3664d6700ab |
15 | 1b093b81ade |
hex | e916b00387 |
1001108013959 has 2 divisors, whose sum is σ = 1001108013960. Its totient is φ = 1001108013958.
The previous prime is 1001108013929. The next prime is 1001108014013. The reversal of 1001108013959 is 9593108011001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001108013959 is a prime.
It is a super-2 number, since 2×10011080139592 (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 (1001108013929) 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, 500554006979 + 500554006980.
It is an arithmetic number, because the mean of its divisors is an integer number (500554006980).
Almost surely, 21001108013959 is an apocalyptic number.
1001108013959 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001108013959 is an equidigital number, since it uses as much as digits as its factorization.
1001108013959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 38.
The spelling of 1001108013959 in words is "one trillion, one billion, one hundred eight million, thirteen thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •