Base | Representation |
---|---|
bin | 11001000010011101001111… |
… | …100010101101011100000001 |
3 | 112102220100222012121021000122 |
4 | 121002131033202231130001 |
5 | 103413201230224014332 |
6 | 1030112232521430025 |
7 | 32123623165302134 |
oct | 3102351742553401 |
9 | 472810865537018 |
10 | 110120001001217 |
11 | 320a66a2819569 |
12 | 10425bb163b315 |
13 | 495a36b74945c |
14 | 1d29b9d46821b |
15 | cae719814c12 |
hex | 64274f8ad701 |
110120001001217 has 2 divisors, whose sum is σ = 110120001001218. Its totient is φ = 110120001001216.
The previous prime is 110120001001193. The next prime is 110120001001243. The reversal of 110120001001217 is 712100100021011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101353166939761 + 8766834061456 = 10067431^2 + 2960884^2 .
It is a cyclic number.
It is not a de Polignac number, because 110120001001217 - 210 = 110120001000193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110120001001195 and 110120001001204.
It is not a weakly prime, because it can be changed into another prime (110120001001117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060000500608 + 55060000500609.
It is an arithmetic number, because the mean of its divisors is an integer number (55060000500609).
Almost surely, 2110120001001217 is an apocalyptic number.
It is an amenable number.
110120001001217 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120001001217 is an equidigital number, since it uses as much as digits as its factorization.
110120001001217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 110120001001217 its reverse (712100100021011), we get a palindrome (822220101022228).
The spelling of 110120001001217 in words is "one hundred ten trillion, one hundred twenty billion, one million, one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •