Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …01101001100000011100100 |
3 | 2122011202022201101121110121 |
4 | 10210201221031030003210 |
5 | 10113323312233311322 |
6 | 110430455000131324 |
7 | 4143223360540513 |
oct | 444415115140344 |
9 | 78152281347417 |
10 | 20102212010212 |
11 | 6450333686152 |
12 | 2307b3a166b44 |
13 | b2a82716b657 |
14 | 4d6d48da467a |
15 | 24cd883b0ec7 |
hex | 12486934c0e4 |
20102212010212 has 6 divisors (see below), whose sum is σ = 35178871017878. Its totient is φ = 10051106005104.
The previous prime is 20102212010203. The next prime is 20102212010213. The reversal of 20102212010212 is 21201021220102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 15057085079716 + 5045126930496 = 3880346^2 + 2246136^2 .
It is not an unprimeable number, because it can be changed into a prime (20102212010213) by changing a digit.
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 as a sum of consecutive naturals, namely, 2512776501273 + ... + 2512776501280.
Almost surely, 220102212010212 is an apocalyptic number.
It is an amenable number.
20102212010212 is a deficient number, since it is larger than the sum of its proper divisors (15076659007666).
20102212010212 is a wasteful number, since it uses less digits than its factorization.
20102212010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5025553002557 (or 5025553002555 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20102212010212 its reverse (21201021220102), we get a palindrome (41303233230314).
It can be divided in two parts, 20102 and 212010212, that multiplied together give a palindrome (4261829281624).
The spelling of 20102212010212 in words is "twenty trillion, one hundred two billion, two hundred twelve million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.087 sec. • engine limits •