Base | Representation |
---|---|
bin | 11001000011101000111000… |
… | …100101000100011001010001 |
3 | 112110012010121111201002121100 |
4 | 121003220320211010121101 |
5 | 103421014044322402233 |
6 | 1030213424105215013 |
7 | 32132526652400244 |
oct | 3103507045043121 |
9 | 473163544632540 |
10 | 110201220122193 |
11 | 32128090901242 |
12 | 10439899791469 |
13 | 4964c1330ba15 |
14 | 1d2daa60ad25b |
15 | cb18bed49813 |
hex | 643a38944651 |
110201220122193 has 12 divisors (see below), whose sum is σ = 159180577563280. Its totient is φ = 73467001287576.
The previous prime is 110201220122143. The next prime is 110201220122197. The reversal of 110201220122193 is 391221022102011.
110201220122193 is a `hidden beast` number, since 1 + 10 + 201 + 220 + 1 + 221 + 9 + 3 = 666.
It is not a de Polignac number, because 110201220122193 - 26 = 110201220122129 is a prime.
It is a super-2 number, since 2×1102012201221932 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110201220122197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38438971 + ... + 41206272.
Almost surely, 2110201220122193 is an apocalyptic number.
It is an amenable number.
110201220122193 is a deficient number, since it is larger than the sum of its proper divisors (48979357441087).
110201220122193 is a wasteful number, since it uses less digits than its factorization.
110201220122193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79798988 (or 79798985 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 110201220122193 in words is "one hundred ten trillion, two hundred one billion, two hundred twenty million, one hundred twenty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •