Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …101001001001011110100001 |
3 | 112102212111202121122012202222 |
4 | 121002110313221021132201 |
5 | 103413024322041214103 |
6 | 1030104144423320425 |
7 | 32123154323021405 |
oct | 3102246751113641 |
9 | 472774677565688 |
10 | 110111010101153 |
11 | 320a28a9683246 |
12 | 104243025b0115 |
13 | 4959567b34149 |
14 | 1d29589341105 |
15 | cae390334638 |
hex | 642537a497a1 |
110111010101153 has 2 divisors, whose sum is σ = 110111010101154. Its totient is φ = 110111010101152.
The previous prime is 110111010101083. The next prime is 110111010101177. The reversal of 110111010101153 is 351101010111011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61818072827809 + 48292937273344 = 7862447^2 + 6949312^2 .
It is an emirp because it is prime and its reverse (351101010111011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110111010101153 is a prime.
It is not a weakly prime, because it can be changed into another prime (110111090101153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055505050576 + 55055505050577.
It is an arithmetic number, because the mean of its divisors is an integer number (55055505050577).
Almost surely, 2110111010101153 is an apocalyptic number.
It is an amenable number.
110111010101153 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111010101153 is an equidigital number, since it uses as much as digits as its factorization.
110111010101153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15, while the sum is 17.
Adding to 110111010101153 its reverse (351101010111011), we get a palindrome (461212020212164).
The spelling of 110111010101153 in words is "one hundred ten trillion, one hundred eleven billion, ten million, one hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •