Base | Representation |
---|---|
bin | 101101101110101101100011… |
… | …111111101110100101111101 |
3 | 222101010002022201212012001200 |
4 | 231232231203333232211331 |
5 | 202330141040433020333 |
6 | 1551430120011130113 |
7 | 60235410256313550 |
oct | 5556554377564575 |
9 | 871102281765050 |
10 | 201122111220093 |
11 | 590a14545a5258 |
12 | 1a682990143939 |
13 | 882b96cc5a92b |
14 | 379450d940697 |
15 | 183b9aacdcc13 |
hex | b6eb63fee97d |
201122111220093 has 48 divisors (see below), whose sum is σ = 332681974200576. Its totient is φ = 114694711361280.
The previous prime is 201122111220061. The next prime is 201122111220103. The reversal of 201122111220093 is 390022111221102.
201122111220093 is a `hidden beast` number, since 201 + 1 + 221 + 11 + 220 + 0 + 9 + 3 = 666.
It is not a de Polignac number, because 201122111220093 - 25 = 201122111220061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201122111210093) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1193228403 + ... + 1193396943.
It is an arithmetic number, because the mean of its divisors is an integer number (6930874462512).
Almost surely, 2201122111220093 is an apocalyptic number.
It is an amenable number.
201122111220093 is a deficient number, since it is larger than the sum of its proper divisors (131559862980483).
201122111220093 is a wasteful number, since it uses less digits than its factorization.
201122111220093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206714 (or 206711 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
Adding to 201122111220093 its reverse (390022111221102), we get a palindrome (591144222441195).
The spelling of 201122111220093 in words is "two hundred one trillion, one hundred twenty-two billion, one hundred eleven million, two hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •