Base | Representation |
---|---|
bin | 11001100000101111100001… |
… | …010101100110100111100100 |
3 | 112201021022221022210011122001 |
4 | 121200233201111212213210 |
5 | 104201301040032211322 |
6 | 1034344305211215044 |
7 | 32430161416220005 |
oct | 3140574125464744 |
9 | 481238838704561 |
10 | 112201211210212 |
11 | 328292a2715353 |
12 | 1070141a747484 |
13 | 4a7b6b4a72817 |
14 | 1d9c7d36bd1ac |
15 | ce8927166827 |
hex | 660be15669e4 |
112201211210212 has 24 divisors (see below), whose sum is σ = 199287432701504. Its totient is φ = 55261984089312.
The previous prime is 112201211210119. The next prime is 112201211210213. The reversal of 112201211210212 is 212012112102211.
It is a happy number.
It is a super-2 number, since 2×1122012112102122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112201211210212.
It is not an unprimeable number, because it can be changed into a prime (112201211210213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6551578 + ... + 16350094.
Almost surely, 2112201211210212 is an apocalyptic number.
It is an amenable number.
112201211210212 is a deficient number, since it is larger than the sum of its proper divisors (87086221491292).
112201211210212 is a wasteful number, since it uses less digits than its factorization.
112201211210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9841315 (or 9841313 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 112201211210212 its reverse (212012112102211), we get a palindrome (324213323312423).
The spelling of 112201211210212 in words is "one hundred twelve trillion, two hundred one billion, two hundred eleven million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •