Base | Representation |
---|---|
bin | 110001001011011100… |
… | …1111111100011011101 |
3 | 101002121012201200021121 |
4 | 1202112321333203131 |
5 | 3212242404000104 |
6 | 120303402130541 |
7 | 10426065455113 |
oct | 1422671774335 |
9 | 332535650247 |
10 | 105611000029 |
11 | 40875724507 |
12 | 18574ab0a51 |
13 | 9c611189c2 |
14 | 517c32dab3 |
15 | 2b31b33254 |
hex | 1896e7f8dd |
105611000029 has 2 divisors, whose sum is σ = 105611000030. Its totient is φ = 105611000028.
The previous prime is 105610999969. The next prime is 105611000041. The reversal of 105611000029 is 920000116501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85211448100 + 20399551929 = 291910^2 + 142827^2 .
It is a cyclic number.
It is not a de Polignac number, because 105611000029 - 215 = 105610967261 is a prime.
It is a super-2 number, since 2×1056110000292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105610999967 and 105611000012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105611000069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52805500014 + 52805500015.
It is an arithmetic number, because the mean of its divisors is an integer number (52805500015).
Almost surely, 2105611000029 is an apocalyptic number.
It is an amenable number.
105611000029 is a deficient number, since it is larger than the sum of its proper divisors (1).
105611000029 is an equidigital number, since it uses as much as digits as its factorization.
105611000029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 25.
The spelling of 105611000029 in words is "one hundred five billion, six hundred eleven million, twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •