Base | Representation |
---|---|
bin | 101111001000000011… |
… | …1011000001111011100 |
3 | 100200012221121102002211 |
4 | 1132100013120033130 |
5 | 3124230214214322 |
6 | 114254104130204 |
7 | 10211611444522 |
oct | 1362007301734 |
9 | 320187542084 |
10 | 101202101212 |
11 | 39a12a47583 |
12 | 17744466964 |
13 | 970a88b434 |
14 | 4c8097a312 |
15 | 2974a3cb77 |
hex | 17901d83dc |
101202101212 has 96 divisors (see below), whose sum is σ = 192854027520. Its totient is φ = 46363054080.
The previous prime is 101202101081. The next prime is 101202101213. The reversal of 101202101212 is 212101202101.
101202101212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 101202101192 and 101202101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101202101213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38669728 + ... + 38672344.
It is an arithmetic number, because the mean of its divisors is an integer number (2008896120).
Almost surely, 2101202101212 is an apocalyptic number.
It is an amenable number.
101202101212 is a deficient number, since it is larger than the sum of its proper divisors (91651926308).
101202101212 is a wasteful number, since it uses less digits than its factorization.
101202101212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2911 (or 2909 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101202101212 its reverse (212101202101), we get a palindrome (313303303313).
It can be divided in two parts, 101202101 and 212, that multiplied together give a palindrome (21454845412).
The spelling of 101202101212 in words is "one hundred one billion, two hundred two million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •