Base | Representation |
---|---|
bin | 10010110100101111… |
… | …011110000100101011 |
3 | 1221011121211202101212 |
4 | 102310233132010223 |
5 | 312343311241021 |
6 | 13141345503335 |
7 | 1313606652545 |
oct | 226457360453 |
9 | 57147752355 |
10 | 20212212011 |
11 | 86322a3052 |
12 | 3b01041b4b |
13 | 1ba1649584 |
14 | d9a566695 |
15 | 7d46d885b |
hex | 4b4bde12b |
20212212011 has 4 divisors (see below), whose sum is σ = 20412333024. Its totient is φ = 20012091000.
The previous prime is 20212212001. The next prime is 20212212073. The reversal of 20212212011 is 11021221202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20212212011 - 222 = 20208017707 is a prime.
It is a super-2 number, since 2×202122120112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20212212001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100060355 + ... + 100060556.
It is an arithmetic number, because the mean of its divisors is an integer number (5103083256).
Almost surely, 220212212011 is an apocalyptic number.
20212212011 is a deficient number, since it is larger than the sum of its proper divisors (200121013).
20212212011 is a wasteful number, since it uses less digits than its factorization.
20212212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200121012.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20212212011 its reverse (11021221202), we get a palindrome (31233433213).
It can be divided in two parts, 2021221201 and 1, that added together give a palindrome (2021221202).
The spelling of 20212212011 in words is "twenty billion, two hundred twelve million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •