Base | Representation |
---|---|
bin | 110001000011100000… |
… | …0011100001001001001 |
3 | 101001220121210121020221 |
4 | 1202013000130021021 |
5 | 3211221112121122 |
6 | 120221112550041 |
7 | 10416346250344 |
oct | 1420700341111 |
9 | 331817717227 |
10 | 105344254537 |
11 | 407490a3695 |
12 | 184bb6b2321 |
13 | 9c1aa92332 |
14 | 5154b3545b |
15 | 2b184e26c7 |
hex | 188701c249 |
105344254537 has 2 divisors, whose sum is σ = 105344254538. Its totient is φ = 105344254536.
The previous prime is 105344254453. The next prime is 105344254579. The reversal of 105344254537 is 735452443501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86504221456 + 18840033081 = 294116^2 + 137259^2 .
It is a cyclic number.
It is not a de Polignac number, because 105344254537 - 227 = 105210036809 is a prime.
It is a super-2 number, since 2×1053442545372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105344254493 and 105344254502.
It is not a weakly prime, because it can be changed into another prime (105344254237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52672127268 + 52672127269.
It is an arithmetic number, because the mean of its divisors is an integer number (52672127269).
Almost surely, 2105344254537 is an apocalyptic number.
It is an amenable number.
105344254537 is a deficient number, since it is larger than the sum of its proper divisors (1).
105344254537 is an equidigital number, since it uses as much as digits as its factorization.
105344254537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008000, while the sum is 43.
The spelling of 105344254537 in words is "one hundred five billion, three hundred forty-four million, two hundred fifty-four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •