Base | Representation |
---|---|
bin | 110000001110011111011000… |
… | …111110011011001010100110 |
3 | 1000210222202100202221022201102 |
4 | 300032133120332123022212 |
5 | 210300034404104034342 |
6 | 2031034152432400102 |
7 | 62450602353031022 |
oct | 6016373076331246 |
9 | 1023882322838642 |
10 | 212102010221222 |
11 | 61644a59311200 |
12 | 1b95695a0a6032 |
13 | 9147197aa39c4 |
14 | 3a53b1361d382 |
15 | 197c3d792a832 |
hex | c0e7d8f9b2a6 |
212102010221222 has 24 divisors (see below), whose sum is σ = 349707006884928. Its totient is φ = 96409556266320.
The previous prime is 212102010221201. The next prime is 212102010221251. The reversal of 212102010221222 is 222122010201212.
It is a super-2 number, since 2×2121020102212222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212102010221194 and 212102010221203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53189588 + ... + 57038024.
It is an arithmetic number, because the mean of its divisors is an integer number (14571125286872).
Almost surely, 2212102010221222 is an apocalyptic number.
212102010221222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212102010221222 is a deficient number, since it is larger than the sum of its proper divisors (137604996663706).
212102010221222 is a wasteful number, since it uses less digits than its factorization.
212102010221222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4076204 (or 4076193 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 212102010221222 its reverse (222122010201212), we get a palindrome (434224020422434).
The spelling of 212102010221222 in words is "two hundred twelve trillion, one hundred two billion, ten million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •