Base | Representation |
---|---|
bin | 110001001011001010… |
… | …0101010101101101101 |
3 | 101002120112022120012202 |
4 | 1202112110222231231 |
5 | 3212232402342331 |
6 | 120302412311245 |
7 | 10425616343246 |
oct | 1422624525555 |
9 | 332515276182 |
10 | 105601215341 |
11 | 40870151096 |
12 | 18571772525 |
13 | 9c5c0a114b |
14 | 517ad03ccd |
15 | 2b30d4decb |
hex | 189652ab6d |
105601215341 has 2 divisors, whose sum is σ = 105601215342. Its totient is φ = 105601215340.
The previous prime is 105601215329. The next prime is 105601215413. The reversal of 105601215341 is 143512106501.
Together with next prime (105601215413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99912888100 + 5688327241 = 316090^2 + 75421^2 .
It is a cyclic number.
It is not a de Polignac number, because 105601215341 - 210 = 105601214317 is a prime.
It is a super-2 number, since 2×1056012153412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105601215541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52800607670 + 52800607671.
It is an arithmetic number, because the mean of its divisors is an integer number (52800607671).
Almost surely, 2105601215341 is an apocalyptic number.
It is an amenable number.
105601215341 is a deficient number, since it is larger than the sum of its proper divisors (1).
105601215341 is an equidigital number, since it uses as much as digits as its factorization.
105601215341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 105601215341 in words is "one hundred five billion, six hundred one million, two hundred fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •