Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0010000010010110101 |
3 | 101112012010120220202112 |
4 | 1212202202100102311 |
5 | 3300441333233104 |
6 | 122325120020405 |
7 | 10645256443115 |
oct | 1464242202265 |
9 | 345163526675 |
10 | 110101071029 |
11 | 4276a203294 |
12 | 19408761705 |
13 | a4c8427051 |
14 | 54867b3045 |
15 | 2ce5e0e86e |
hex | 19a28904b5 |
110101071029 has 2 divisors, whose sum is σ = 110101071030. Its totient is φ = 110101071028.
The previous prime is 110101071019. The next prime is 110101071037. The reversal of 110101071029 is 920170101011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82010640625 + 28090430404 = 286375^2 + 167602^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110101071029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110101070995 and 110101071013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110101071019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050535514 + 55050535515.
It is an arithmetic number, because the mean of its divisors is an integer number (55050535515).
Almost surely, 2110101071029 is an apocalyptic number.
It is an amenable number.
110101071029 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101071029 is an equidigital number, since it uses as much as digits as its factorization.
110101071029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 23.
The spelling of 110101071029 in words is "one hundred ten billion, one hundred one million, seventy-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •