Base | Representation |
---|---|
bin | 11001000010011101001111… |
… | …100011001010101110110001 |
3 | 112102220100222012211100121111 |
4 | 121002131033203022232301 |
5 | 103413201230241334301 |
6 | 1030112232524153321 |
7 | 32123623166312011 |
oct | 3102351743125661 |
9 | 472810865740544 |
10 | 110120001121201 |
11 | 320a66a28a0725 |
12 | 10425bb1698841 |
13 | 495a36b78bc56 |
14 | 1d29b9d499c41 |
15 | cae71983a551 |
hex | 64274f8cabb1 |
110120001121201 has 2 divisors, whose sum is σ = 110120001121202. Its totient is φ = 110120001121200.
The previous prime is 110120001121199. The next prime is 110120001121211. The reversal of 110120001121201 is 102121100021011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109674512953600 + 445488167601 = 10472560^2 + 667449^2 .
It is a cyclic number.
It is not a de Polignac number, because 110120001121201 - 21 = 110120001121199 is a prime.
Together with 110120001121199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110120001121211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060000560600 + 55060000560601.
It is an arithmetic number, because the mean of its divisors is an integer number (55060000560601).
Almost surely, 2110120001121201 is an apocalyptic number.
It is an amenable number.
110120001121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120001121201 is an equidigital number, since it uses as much as digits as its factorization.
110120001121201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110120001121201 its reverse (102121100021011), we get a palindrome (212241101142212).
The spelling of 110120001121201 in words is "one hundred ten trillion, one hundred twenty billion, one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •