Base | Representation |
---|---|
bin | 1100100110110… |
… | …11010101111101 |
3 | 21100222221222222 |
4 | 12103123111331 |
5 | 204033143104 |
6 | 14254415125 |
7 | 2422624421 |
oct | 623332575 |
9 | 240887888 |
10 | 105756029 |
11 | 54773085 |
12 | 2b5014a5 |
13 | 18baa742 |
14 | 1008cb81 |
15 | 94401be |
hex | 64db57d |
105756029 has 2 divisors, whose sum is σ = 105756030. Its totient is φ = 105756028.
The previous prime is 105756023. The next prime is 105756037. The reversal of 105756029 is 920657501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102050404 + 3705625 = 10102^2 + 1925^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105756029 is a prime.
It is a super-2 number, since 2×1057560292 = 22368675339697682, which contains 22 as substring.
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 105756029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105756023) 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, 52878014 + 52878015.
It is an arithmetic number, because the mean of its divisors is an integer number (52878015).
Almost surely, 2105756029 is an apocalyptic number.
It is an amenable number.
105756029 is a deficient number, since it is larger than the sum of its proper divisors (1).
105756029 is an equidigital number, since it uses as much as digits as its factorization.
105756029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 35.
The square root of 105756029 is about 10283.7750364348. The cubic root of 105756029 is about 472.8989812384.
The spelling of 105756029 in words is "one hundred five million, seven hundred fifty-six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •