Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000000111011010101111 |
3 | 10221010010111122111202011 |
4 | 100021301300013122233 |
5 | 121141300030013241 |
6 | 2205533114342051 |
7 | 143124040222066 |
oct | 20116160073257 |
9 | 3833114574664 |
10 | 1110010001071 |
11 | 398830786a54 |
12 | 15b16412a927 |
13 | 8089a88792a |
14 | 3ba20ab11dd |
15 | 1dd19687281 |
hex | 10271c076af |
1110010001071 has 2 divisors, whose sum is σ = 1110010001072. Its totient is φ = 1110010001070.
The previous prime is 1110010001027. The next prime is 1110010001077. The reversal of 1110010001071 is 1701000100111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110010001071 - 215 = 1110009968303 is a prime.
It is a super-2 number, since 2×11100100010712 (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 (1110010001077) 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, 555005000535 + 555005000536.
It is an arithmetic number, because the mean of its divisors is an integer number (555005000536).
Almost surely, 21110010001071 is an apocalyptic number.
1110010001071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110010001071 is an equidigital number, since it uses as much as digits as its factorization.
1110010001071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 1110010001071 its reverse (1701000100111), we get a palindrome (2811010101182).
The spelling of 1110010001071 in words is "one trillion, one hundred ten billion, ten million, one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •