Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0000101101011010100 |
3 | 100200020120201200120211 |
4 | 1132100222011223110 |
5 | 3124240031401322 |
6 | 114255031135204 |
7 | 10212052002313 |
oct | 1362052055324 |
9 | 320216650524 |
10 | 101211200212 |
11 | 39a180a1811 |
12 | 17747514504 |
13 | 970c725b65 |
14 | 4c81c6827a |
15 | 2975738b77 |
hex | 1790a85ad4 |
101211200212 has 12 divisors (see below), whose sum is σ = 177132605076. Its totient is φ = 50601884480.
The previous prime is 101211200201. The next prime is 101211200231. The reversal of 101211200212 is 212002112101.
It can be written as a sum of positive squares in 2 ways, for example, as 7554391056 + 93656809156 = 86916^2 + 306034^2 .
It is a super-3 number, since 3×1012112002123 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101211200192 and 101211200201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 867163 + ... + 976930.
It is an arithmetic number, because the mean of its divisors is an integer number (14761050423).
Almost surely, 2101211200212 is an apocalyptic number.
It is an amenable number.
101211200212 is a deficient number, since it is larger than the sum of its proper divisors (75921404864).
101211200212 is a wasteful number, since it uses less digits than its factorization.
101211200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1857818 (or 1857816 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101211200212 its reverse (212002112101), we get a palindrome (313213312313).
The spelling of 101211200212 in words is "one hundred one billion, two hundred eleven million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •