Base | Representation |
---|---|
bin | 110000001111111010101001… |
… | …110000001010010110111110 |
3 | 1000211100010022000010200002121 |
4 | 300033322221300022112332 |
5 | 210303141101030413042 |
6 | 2031151200224513154 |
7 | 62460641605102153 |
oct | 6017725160122676 |
9 | 1024303260120077 |
10 | 212200002201022 |
11 | 61682574221a80 |
12 | 1b97194747b7ba |
13 | 91534b358b6c4 |
14 | 3a5876bad822a |
15 | 197ec2071b367 |
hex | c0fea9c0a5be |
212200002201022 has 8 divisors (see below), whose sum is σ = 347236367238072. Its totient is φ = 96454546455000.
The previous prime is 212200002201017. The next prime is 212200002201041. The reversal of 212200002201022 is 220102200002212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2122000022010222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212200002200987 and 212200002201005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4822727322729 + ... + 4822727322772.
It is an arithmetic number, because the mean of its divisors is an integer number (43404545904759).
Almost surely, 2212200002201022 is an apocalyptic number.
212200002201022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212200002201022 is a deficient number, since it is larger than the sum of its proper divisors (135036365037050).
212200002201022 is a wasteful number, since it uses less digits than its factorization.
212200002201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9645454645514.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 212200002201022 its reverse (220102200002212), we get a palindrome (432302202203234).
The spelling of 212200002201022 in words is "two hundred twelve trillion, two hundred billion, two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •