Base | Representation |
---|---|
bin | 110010000001011100111011… |
… | …100111110101011011011100 |
3 | 1001211221222220022121210220220 |
4 | 302001130323213311123130 |
5 | 212314003310141214322 |
6 | 2055523324002241340 |
7 | 64224425244034125 |
oct | 6201347347653334 |
9 | 1054858808553826 |
10 | 220002110101212 |
11 | 6411040978868a |
12 | 20811a71656250 |
13 | 959b1577893ca |
14 | 3c482321db04c |
15 | 1a67b5e2d555c |
hex | c8173b9f56dc |
220002110101212 has 24 divisors (see below), whose sum is σ = 513359984328576. Its totient is φ = 73330932782448.
The previous prime is 220002110101211. The next prime is 220002110101219. The reversal of 220002110101212 is 212101011200022.
It is a junction number, because it is equal to n+sod(n) for n = 220002110101191 and 220002110101200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220002110101211) 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, 387694408 + ... + 388261455.
It is an arithmetic number, because the mean of its divisors is an integer number (21389999347024).
Almost surely, 2220002110101212 is an apocalyptic number.
It is an amenable number.
220002110101212 is an abundant number, since it is smaller than the sum of its proper divisors (293357874227364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220002110101212 is a wasteful number, since it uses less digits than its factorization.
220002110101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775979497 (or 775979495 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220002110101212 its reverse (212101011200022), we get a palindrome (432103121301234).
The spelling of 220002110101212 in words is "two hundred twenty trillion, two billion, one hundred ten million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •