Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …000011111110100100101001 |
3 | 112110012010001212112221010102 |
4 | 121003220230003332210221 |
5 | 103421013132042333001 |
6 | 1030213351204155145 |
7 | 32132521522410002 |
oct | 3103505403764451 |
9 | 473163055487112 |
10 | 110201010121001 |
11 | 32127a93308238 |
12 | 1043983b398ab5 |
13 | 4964bab962467 |
14 | 1d2da862461a9 |
15 | cb18ab6b6e6b |
hex | 643a2c0fe929 |
110201010121001 has 2 divisors, whose sum is σ = 110201010121002. Its totient is φ = 110201010121000.
The previous prime is 110201010120899. The next prime is 110201010121021. The reversal of 110201010121001 is 100121010102011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62692744515625 + 47508265605376 = 7917875^2 + 6892624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110201010121001 is a prime.
It is a super-2 number, since 2×1102010101210012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110201010121021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100505060500 + 55100505060501.
It is an arithmetic number, because the mean of its divisors is an integer number (55100505060501).
Almost surely, 2110201010121001 is an apocalyptic number.
It is an amenable number.
110201010121001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201010121001 is an equidigital number, since it uses as much as digits as its factorization.
110201010121001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110201010121001 its reverse (100121010102011), we get a palindrome (210322020223012).
The spelling of 110201010121001 in words is "one hundred ten trillion, two hundred one billion, ten million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •