Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …111100001101000101001 |
3 | 10221010100220222200112102 |
4 | 100021313033201220221 |
5 | 121141442120333001 |
6 | 2205550205023145 |
7 | 143126236224236 |
oct | 20116717415051 |
9 | 3833326880472 |
10 | 1110102121001 |
11 | 398878786025 |
12 | 15b18ab54ab5 |
13 | 808b399c773 |
14 | 3ba2d01078d |
15 | 1dd227d1e6b |
hex | 102773e1a29 |
1110102121001 has 2 divisors, whose sum is σ = 1110102121002. Its totient is φ = 1110102121000.
The previous prime is 1110102120979. The next prime is 1110102121027. The reversal of 1110102121001 is 1001212010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1056888858601 + 53213262400 = 1028051^2 + 230680^2 .
It is an emirp because it is prime and its reverse (1001212010111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110102121001 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110102121091) 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, 555051060500 + 555051060501.
It is an arithmetic number, because the mean of its divisors is an integer number (555051060501).
Almost surely, 21110102121001 is an apocalyptic number.
It is an amenable number.
1110102121001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110102121001 is an equidigital number, since it uses as much as digits as its factorization.
1110102121001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1110102121001 its reverse (1001212010111), we get a palindrome (2111314131112).
The spelling of 1110102121001 in words is "one trillion, one hundred ten billion, one hundred two million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •