Base | Representation |
---|---|
bin | 110000001110101000110011… |
… | …000010010000100000111010 |
3 | 1000211000201102201112122111200 |
4 | 300032220303002100200322 |
5 | 210300221100421011302 |
6 | 2031042543021435030 |
7 | 62451410564126652 |
oct | 6016506302204072 |
9 | 1024021381478450 |
10 | 212112111110202 |
11 | 61649271a74636 |
12 | 1b9588b8a0ba76 |
13 | 91481176564a4 |
14 | 3a543d0d25362 |
15 | 197c7c95b681c |
hex | c0ea3309083a |
212112111110202 has 96 divisors (see below), whose sum is σ = 485454146233680. Its totient is φ = 66839349104640.
The previous prime is 212112111110149. The next prime is 212112111110213. The reversal of 212112111110202 is 202011111211212.
It is a happy number.
212112111110202 is a `hidden beast` number, since 21 + 211 + 211 + 11 + 10 + 202 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 82515949301241 + 129596161808961 = 9083829^2 + 11384031^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15094699 + ... + 25535742.
Almost surely, 2212112111110202 is an apocalyptic number.
212112111110202 is an abundant number, since it is smaller than the sum of its proper divisors (273342035123478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212112111110202 is a wasteful number, since it uses less digits than its factorization.
212112111110202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40630688 (or 40630685 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 212112111110202 its reverse (202011111211212), we get a palindrome (414123222321414).
The spelling of 212112111110202 in words is "two hundred twelve trillion, one hundred twelve billion, one hundred eleven million, one hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •