Base | Representation |
---|---|
bin | 10000001001111111100… |
… | …111001110010011110011 |
3 | 10221010201201020021022111 |
4 | 100021333213032103303 |
5 | 121142234043113102 |
6 | 2210012142550151 |
7 | 143132562655231 |
oct | 20117747162363 |
9 | 3833651207274 |
10 | 1110242551027 |
11 | 39893aa811a5 |
12 | 15b209b98357 |
13 | 80906aca75c |
14 | 3ba43927951 |
15 | 1dd2ecc0cd7 |
hex | 1027f9ce4f3 |
1110242551027 has 2 divisors, whose sum is σ = 1110242551028. Its totient is φ = 1110242551026.
The previous prime is 1110242551007. The next prime is 1110242551031. The reversal of 1110242551027 is 7201552420111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110242551027 is a prime.
It is a super-2 number, since 2×11102425510272 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1110242551027.
It is not a weakly prime, because it can be changed into another prime (1110242551007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555121275513 + 555121275514.
It is an arithmetic number, because the mean of its divisors is an integer number (555121275514).
Almost surely, 21110242551027 is an apocalyptic number.
1110242551027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110242551027 is an equidigital number, since it uses as much as digits as its factorization.
1110242551027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5600, while the sum is 31.
Adding to 1110242551027 its reverse (7201552420111), we get a palindrome (8311794971138).
The spelling of 1110242551027 in words is "one trillion, one hundred ten billion, two hundred forty-two million, five hundred fifty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •