Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …110101101001010101011101 |
3 | 111010111110212001000002212102 |
4 | 112300330331311221111131 |
5 | 101110340322122011143 |
6 | 552534543415414445 |
7 | 30042335133123626 |
oct | 2660747565512535 |
9 | 433443761002772 |
10 | 100121020110173 |
11 | 299a10a4780157 |
12 | b29015b084425 |
13 | 43b34aa78baaa |
14 | 1aa1c5181ca4d |
15 | b8959e0ca0b8 |
hex | 5b0f3dd6955d |
100121020110173 has 2 divisors, whose sum is σ = 100121020110174. Its totient is φ = 100121020110172.
The previous prime is 100121020110169. The next prime is 100121020110211. The reversal of 100121020110173 is 371011020121001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99891269571844 + 229750538329 = 9994562^2 + 479323^2 .
It is a cyclic number.
It is not a de Polignac number, because 100121020110173 - 22 = 100121020110169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100121020110073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060510055086 + 50060510055087.
It is an arithmetic number, because the mean of its divisors is an integer number (50060510055087).
Almost surely, 2100121020110173 is an apocalyptic number.
It is an amenable number.
100121020110173 is a deficient number, since it is larger than the sum of its proper divisors (1).
100121020110173 is an equidigital number, since it uses as much as digits as its factorization.
100121020110173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 100121020110173 its reverse (371011020121001), we get a palindrome (471132040231174).
The spelling of 100121020110173 in words is "one hundred trillion, one hundred twenty-one billion, twenty million, one hundred ten thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •