Base | Representation |
---|---|
bin | 10111111100011110100000… |
… | …110100000110010000010001 |
3 | 111210212122002201221121121102 |
4 | 113330132200310012100101 |
5 | 102300403412243023124 |
6 | 1011551112301034145 |
7 | 31116316532041145 |
oct | 2774364064062021 |
9 | 453778081847542 |
10 | 105311001142289 |
11 | 30612165768a68 |
12 | b989b89255955 |
13 | 469ba28273357 |
14 | 1c011187c7225 |
15 | c295aa3b7aae |
hex | 5fc7a0d06411 |
105311001142289 has 2 divisors, whose sum is σ = 105311001142290. Its totient is φ = 105311001142288.
The previous prime is 105311001142213. The next prime is 105311001142301. The reversal of 105311001142289 is 982241100113501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101713276090000 + 3597725052289 = 10085300^2 + 1896767^2 .
It is a cyclic number.
It is not a de Polignac number, because 105311001142289 - 220 = 105311000093713 is a prime.
It is a super-2 number, since 2×1053110011422892 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (105311001142189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52655500571144 + 52655500571145.
It is an arithmetic number, because the mean of its divisors is an integer number (52655500571145).
Almost surely, 2105311001142289 is an apocalyptic number.
It is an amenable number.
105311001142289 is a deficient number, since it is larger than the sum of its proper divisors (1).
105311001142289 is an equidigital number, since it uses as much as digits as its factorization.
105311001142289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 38.
The spelling of 105311001142289 in words is "one hundred five trillion, three hundred eleven billion, one million, one hundred forty-two thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •