Base | Representation |
---|---|
bin | 10111111011100010111011… |
… | …001111011010100100001011 |
3 | 111210122111221210010220110002 |
4 | 113323202323033122210023 |
5 | 102243331344110022142 |
6 | 1011501451415113215 |
7 | 31111563161235134 |
oct | 2773427317324413 |
9 | 453574853126402 |
10 | 105247020001547 |
11 | 30598013008a46 |
12 | b9796b207280b |
13 | 469599ca988a8 |
14 | 1bdbda92ccc8b |
15 | c27ab33b7a32 |
hex | 5fb8bb3da90b |
105247020001547 has 2 divisors, whose sum is σ = 105247020001548. Its totient is φ = 105247020001546.
The previous prime is 105247020001463. The next prime is 105247020001549. The reversal of 105247020001547 is 745100020742501.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105247020001547 - 228 = 105246751566091 is a prime.
It is a super-2 number, since 2×1052470200015472 (a number of 29 digits) contains 22 as substring.
Together with 105247020001549, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 105247020001547.
It is not a weakly prime, because it can be changed into another prime (105247020001549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52623510000773 + 52623510000774.
It is an arithmetic number, because the mean of its divisors is an integer number (52623510000774).
Almost surely, 2105247020001547 is an apocalyptic number.
105247020001547 is a deficient number, since it is larger than the sum of its proper divisors (1).
105247020001547 is an equidigital number, since it uses as much as digits as its factorization.
105247020001547 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78400, while the sum is 38.
The spelling of 105247020001547 in words is "one hundred five trillion, two hundred forty-seven billion, twenty million, one thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •