Base | Representation |
---|---|
bin | 110001000011100000… |
… | …0110001100111100001 |
3 | 101001220121222001220201 |
4 | 1202013000301213201 |
5 | 3211221122424442 |
6 | 120221114505201 |
7 | 10416350064652 |
oct | 1420700614741 |
9 | 331817861821 |
10 | 105344342497 |
11 | 40749153789 |
12 | 184bb735201 |
13 | 9c1aac3394 |
14 | 5154b59529 |
15 | 2b1850d7b7 |
hex | 18870319e1 |
105344342497 has 2 divisors, whose sum is σ = 105344342498. Its totient is φ = 105344342496.
The previous prime is 105344342489. The next prime is 105344342513. The reversal of 105344342497 is 794243443501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71113422241 + 34230920256 = 266671^2 + 185016^2 .
It is a cyclic number.
It is not a de Polignac number, because 105344342497 - 23 = 105344342489 is a prime.
It is a super-2 number, since 2×1053443424972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105344348497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52672171248 + 52672171249.
It is an arithmetic number, because the mean of its divisors is an integer number (52672171249).
Almost surely, 2105344342497 is an apocalyptic number.
It is an amenable number.
105344342497 is a deficient number, since it is larger than the sum of its proper divisors (1).
105344342497 is an equidigital number, since it uses as much as digits as its factorization.
105344342497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 46.
Adding to 105344342497 its reverse (794243443501), we get a palindrome (899587785998).
It can be divided in two parts, 1053443 and 42497, that added together give a triangular number (1095940 = T1480).
The spelling of 105344342497 in words is "one hundred five billion, three hundred forty-four million, three hundred forty-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •