Base | Representation |
---|---|
bin | 11110101111000000010… |
… | …00010101111101001101 |
3 | 10201221210100121200112202 |
4 | 33113200020111331031 |
5 | 114300220440132424 |
6 | 2125044321211245 |
7 | 136203224461265 |
oct | 17274010257515 |
9 | 3657710550482 |
10 | 1056027270989 |
11 | 377949955939 |
12 | 1507b9490b25 |
13 | 787769620b2 |
14 | 3917d4447a5 |
15 | 1c70a32e2ae |
hex | f5e0215f4d |
1056027270989 has 2 divisors, whose sum is σ = 1056027270990. Its totient is φ = 1056027270988.
The previous prime is 1056027270919. The next prime is 1056027271003. The reversal of 1056027270989 is 9890727206501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 611594382025 + 444432888964 = 782045^2 + 666658^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056027270989 - 28 = 1056027270733 is a prime.
It is a super-2 number, since 2×10560272709892 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056027270919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528013635494 + 528013635495.
It is an arithmetic number, because the mean of its divisors is an integer number (528013635495).
Almost surely, 21056027270989 is an apocalyptic number.
It is an amenable number.
1056027270989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056027270989 is an equidigital number, since it uses as much as digits as its factorization.
1056027270989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3810240, while the sum is 56.
The spelling of 1056027270989 in words is "one trillion, fifty-six billion, twenty-seven million, two hundred seventy thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •