Base | Representation |
---|---|
bin | 1100010110100101001… |
… | …1000110001000000011 |
3 | 202021202222101120012211 |
4 | 3011221103012020003 |
5 | 11434111310323021 |
6 | 241254215202551 |
7 | 21222003221161 |
oct | 3055123061003 |
9 | 667688346184 |
10 | 212220011011 |
11 | 82002733358 |
12 | 35168076457 |
13 | 17020c26418 |
14 | a3b3010231 |
15 | 57c11a33e1 |
hex | 31694c6203 |
212220011011 has 4 divisors (see below), whose sum is σ = 212221064224. Its totient is φ = 212218957800.
The previous prime is 212220011009. The next prime is 212220011021. The reversal of 212220011011 is 110110022212.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 212220011011 - 21 = 212220011009 is a prime.
It is a super-2 number, since 2×2122200110112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212220010982 and 212220011000.
It is not an unprimeable number, because it can be changed into a prime (212220011021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119400 + ... + 662341.
It is an arithmetic number, because the mean of its divisors is an integer number (53055266056).
Almost surely, 2212220011011 is an apocalyptic number.
212220011011 is a deficient number, since it is larger than the sum of its proper divisors (1053213).
212220011011 is an equidigital number, since it uses as much as digits as its factorization.
212220011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212220011011 its reverse (110110022212), we get a palindrome (322330033223).
The spelling of 212220011011 in words is "two hundred twelve billion, two hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •