Base | Representation |
---|---|
bin | 1100100101110… |
… | …10001000111101 |
3 | 21100202001102221 |
4 | 12102322020331 |
5 | 204014320104 |
6 | 14251445341 |
7 | 2421520054 |
oct | 622721075 |
9 | 240661387 |
10 | 105620029 |
11 | 5468a989 |
12 | 2b456851 |
13 | 18b60878 |
14 | 1005539b |
15 | 9414c54 |
hex | 64ba23d |
105620029 has 2 divisors, whose sum is σ = 105620030. Its totient is φ = 105620028.
The previous prime is 105620027. The next prime is 105620057. The reversal of 105620029 is 920026501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104244100 + 1375929 = 10210^2 + 1173^2 .
It is an emirp because it is prime and its reverse (920026501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105620029 - 21 = 105620027 is a prime.
It is a super-2 number, since 2×1056200292 = 22311181051921682, which contains 22 as substring.
Together with 105620027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 105619985 and 105620012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105620027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52810014 + 52810015.
It is an arithmetic number, because the mean of its divisors is an integer number (52810015).
Almost surely, 2105620029 is an apocalyptic number.
It is an amenable number.
105620029 is a deficient number, since it is larger than the sum of its proper divisors (1).
105620029 is an equidigital number, since it uses as much as digits as its factorization.
105620029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 105620029 is about 10277.1605514364. The cubic root of 105620029 is about 472.6961816102.
The spelling of 105620029 in words is "one hundred five million, six hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •