Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01000100111001100001 |
3 | 10112121110110110212022221 |
4 | 32203123101010321201 |
5 | 112341211420140424 |
6 | 2043240015431041 |
7 | 132153454040155 |
oct | 16433321047141 |
9 | 3477413425287 |
10 | 1000111099489 |
11 | 356165708657 |
12 | 1419b3225481 |
13 | 734052c7498 |
14 | 365970c7065 |
15 | 1b0363ae9e4 |
hex | e8db444e61 |
1000111099489 has 2 divisors, whose sum is σ = 1000111099490. Its totient is φ = 1000111099488.
The previous prime is 1000111099451. The next prime is 1000111099511. The reversal of 1000111099489 is 9849901110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 933092245089 + 67018854400 = 965967^2 + 258880^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000111099489 - 221 = 1000109002337 is a prime.
It is a super-2 number, since 2×10001110994892 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1000111099189) 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, 500055549744 + 500055549745.
It is an arithmetic number, because the mean of its divisors is an integer number (500055549745).
Almost surely, 21000111099489 is an apocalyptic number.
It is an amenable number.
1000111099489 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111099489 is an equidigital number, since it uses as much as digits as its factorization.
1000111099489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 43.
The spelling of 1000111099489 in words is "one trillion, one hundred eleven million, ninety-nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •