Base | Representation |
---|---|
bin | 100000111101011… |
… | …0000000000011101 |
3 | 2212001222120002002 |
4 | 1001322300000131 |
5 | 4231103420104 |
6 | 301423412045 |
7 | 36256110434 |
oct | 10172600035 |
9 | 2761876062 |
10 | 1105920029 |
11 | 5182990a5 |
12 | 26a454025 |
13 | 148174466 |
14 | a6c4011b |
15 | 6715501e |
hex | 41eb001d |
1105920029 has 2 divisors, whose sum is σ = 1105920030. Its totient is φ = 1105920028.
The previous prime is 1105919993. The next prime is 1105920031. The reversal of 1105920029 is 9200295011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1083923929 + 21996100 = 32923^2 + 4690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1105920029 is a prime.
It is a super-2 number, since 2×11059200292 = 2446118221086721682, which contains 22 as substring.
Together with 1105920031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1105919983 and 1105920010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105920059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552960014 + 552960015.
It is an arithmetic number, because the mean of its divisors is an integer number (552960015).
Almost surely, 21105920029 is an apocalyptic number.
It is an amenable number.
1105920029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105920029 is an equidigital number, since it uses as much as digits as its factorization.
1105920029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 29.
The square root of 1105920029 is about 33255.3759413422. The cubic root of 1105920029 is about 1034.1286602545.
The spelling of 1105920029 in words is "one billion, one hundred five million, nine hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •