Base | Representation |
---|---|
bin | 11001000010010101001010… |
… | …110110010100001100011101 |
3 | 112102212112121001221121222102 |
4 | 121002111022312110030131 |
5 | 103413031002033220104 |
6 | 1030104240413454445 |
7 | 32123165314601135 |
oct | 3102251266241435 |
9 | 472775531847872 |
10 | 110111332320029 |
11 | 320a2a54553037 |
12 | 104243924a1425 |
13 | 49595b98112c1 |
14 | 1d295ba059ac5 |
15 | cae3ad781a1e |
hex | 64254ad9431d |
110111332320029 has 2 divisors, whose sum is σ = 110111332320030. Its totient is φ = 110111332320028.
The previous prime is 110111332320023. The next prime is 110111332320167. The reversal of 110111332320029 is 920023233111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97212244579129 + 12899087740900 = 9859627^2 + 3591530^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111332320029 - 228 = 110111063884573 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 = 110111332319983 and 110111332320010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111332320023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055666160014 + 55055666160015.
It is an arithmetic number, because the mean of its divisors is an integer number (55055666160015).
Almost surely, 2110111332320029 is an apocalyptic number.
It is an amenable number.
110111332320029 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111332320029 is an equidigital number, since it uses as much as digits as its factorization.
110111332320029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 110111332320029 in words is "one hundred ten trillion, one hundred eleven billion, three hundred thirty-two million, three hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •