Base | Representation |
---|---|
bin | 11001011111100101000000… |
… | …010111101001010000011001 |
3 | 112200222200102021211122020000 |
4 | 121133211000113221100121 |
5 | 104143443210001432301 |
6 | 1034243434015123213 |
7 | 32421326613323352 |
oct | 3137450027512031 |
9 | 480880367748200 |
10 | 112121201202201 |
11 | 327a83750a3094 |
12 | 106a9a0b513509 |
13 | 4a73ca3845609 |
14 | 1d989a349ad29 |
15 | ce67e2d6c786 |
hex | 65f9405e9419 |
112121201202201 has 40 divisors (see below), whose sum is σ = 167708878012104. Its totient is φ = 74649696422400.
The previous prime is 112121201202191. The next prime is 112121201202221. The reversal of 112121201202201 is 102202102121211.
112121201202201 is a `hidden beast` number, since 11 + 212 + 1 + 201 + 20 + 220 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 11539337241600 + 100581863960601 = 3396960^2 + 10029051^2 .
It is not a de Polignac number, because 112121201202201 - 211 = 112121201200153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112121201202221) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 266368561 + ... + 266789153.
Almost surely, 2112121201202201 is an apocalyptic number.
It is an amenable number.
112121201202201 is a deficient number, since it is larger than the sum of its proper divisors (55587676809903).
112121201202201 is an equidigital number, since it uses as much as digits as its factorization.
112121201202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424903 (or 424894 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 112121201202201 its reverse (102202102121211), we get a palindrome (214323303323412).
The spelling of 112121201202201 in words is "one hundred twelve trillion, one hundred twenty-one billion, two hundred one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •