Base | Representation |
---|---|
bin | 110001001011010110… |
… | …0011101001010010001 |
3 | 101002120222001101022111 |
4 | 1202112230131022101 |
5 | 3212241001420111 |
6 | 120303154105321 |
7 | 10426023344653 |
oct | 1422654351221 |
9 | 332528041274 |
10 | 105607451281 |
11 | 40873720262 |
12 | 1857387b241 |
13 | 9c60475657 |
14 | 517ba886d3 |
15 | 2b31681a21 |
hex | 1896b1d291 |
105607451281 has 2 divisors, whose sum is σ = 105607451282. Its totient is φ = 105607451280.
The previous prime is 105607451251. The next prime is 105607451329. The reversal of 105607451281 is 182154706501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56803572225 + 48803879056 = 238335^2 + 220916^2 .
It is an emirp because it is prime and its reverse (182154706501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105607451281 - 29 = 105607450769 is a prime.
It is a super-2 number, since 2×1056074512812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105607451251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52803725640 + 52803725641.
It is an arithmetic number, because the mean of its divisors is an integer number (52803725641).
Almost surely, 2105607451281 is an apocalyptic number.
It is an amenable number.
105607451281 is a deficient number, since it is larger than the sum of its proper divisors (1).
105607451281 is an equidigital number, since it uses as much as digits as its factorization.
105607451281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67200, while the sum is 40.
The spelling of 105607451281 in words is "one hundred five billion, six hundred seven million, four hundred fifty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •