Base | Representation |
---|---|
bin | 100110100100… |
… | …0100100110011 |
3 | 1102001021220201 |
4 | 1031020210303 |
5 | 20134021321 |
6 | 2001220031 |
7 | 333604024 |
oct | 115104463 |
9 | 42037821 |
10 | 20220211 |
11 | 10460820 |
12 | 6931617 |
13 | 425c72b |
14 | 2984c4b |
15 | 1b96291 |
hex | 1348933 |
20220211 has 8 divisors (see below), whose sum is σ = 22325184. Its totient is φ = 18159720.
The previous prime is 20220173. The next prime is 20220217. The reversal of 20220211 is 11202202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20220211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20220217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10161 + ... + 11986.
It is an arithmetic number, because the mean of its divisors is an integer number (2790648).
Almost surely, 220220211 is an apocalyptic number.
20220211 is a deficient number, since it is larger than the sum of its proper divisors (2104973).
20220211 is a wasteful number, since it uses less digits than its factorization.
20220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22241.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 20220211 is about 4496.6888929522. The cubic root of 20220211 is about 272.4343685050.
Adding to 20220211 its reverse (11202202), we get a palindrome (31422413).
Subtracting from 20220211 its reverse (11202202), we obtain a square (9018009 = 30032).
It can be divided in two parts, 202202 and 11, that multiplied together give a palindrome (2224222).
The spelling of 20220211 in words is "twenty million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •