Base | Representation |
---|---|
bin | 101111110010110101111101… |
… | …100100110000001101110100 |
3 | 1000120021010100211222001011000 |
4 | 233302311331210300031310 |
5 | 210022422400403021322 |
6 | 2023021302345043300 |
7 | 62163413011004433 |
oct | 5762657544601564 |
9 | 1016233324861130 |
10 | 210202101220212 |
11 | 60a822351aa3a2 |
12 | 1b6aa6aa486530 |
13 | 9039c85b6092a |
14 | 39c9b9bd1b11a |
15 | 1947c8bb603ac |
hex | bf2d7d930374 |
210202101220212 has 24 divisors (see below), whose sum is σ = 544968410571200. Its totient is φ = 70067367073368.
The previous prime is 210202101220211. The next prime is 210202101220253. The reversal of 210202101220212 is 212022101202012.
It is a happy number.
210202101220212 is a `hidden beast` number, since 2 + 1 + 0 + 20 + 210 + 1 + 220 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210202101220211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 973157875912 + ... + 973157876127.
Almost surely, 2210202101220212 is an apocalyptic number.
It is an amenable number.
210202101220212 is an abundant number, since it is smaller than the sum of its proper divisors (334766309350988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210202101220212 is a wasteful number, since it uses less digits than its factorization.
210202101220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1946315752052 (or 1946315752044 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 210202101220212 its reverse (212022101202012), we get a palindrome (422224202422224).
The spelling of 210202101220212 in words is "two hundred ten trillion, two hundred two billion, one hundred one million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •