Base | Representation |
---|---|
bin | 111100001101000… |
… | …0111001101111111 |
3 | 12012210012021122111 |
4 | 1320122013031333 |
5 | 13114122024411 |
6 | 532241554451 |
7 | 101026443055 |
oct | 17032071577 |
9 | 5183167574 |
10 | 2020111231 |
11 | 947333516 |
12 | 484645a27 |
13 | 2626992b8 |
14 | 1524121d5 |
15 | bc536721 |
hex | 7868737f |
2020111231 has 4 divisors (see below), whose sum is σ = 2042809200. Its totient is φ = 1997413264.
The previous prime is 2020111213. The next prime is 2020111253. The reversal of 2020111231 is 1321110202.
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 2020111231 - 221 = 2018014079 is a prime.
It is a super-2 number, since 2×20201112312 = 8161698771224670722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020111031) 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, 11348851 + ... + 11349028.
It is an arithmetic number, because the mean of its divisors is an integer number (510702300).
Almost surely, 22020111231 is an apocalyptic number.
2020111231 is a deficient number, since it is larger than the sum of its proper divisors (22697969).
2020111231 is an equidigital number, since it uses as much as digits as its factorization.
2020111231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22697968.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 2020111231 is about 44945.6475200881. The cubic root of 2020111231 is about 1264.1300670563.
Adding to 2020111231 its reverse (1321110202), we get a palindrome (3341221433).
The spelling of 2020111231 in words is "two billion, twenty million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •