Base | Representation |
---|---|
bin | 111100001100111… |
… | …0001010001010011 |
3 | 12012210000201022212 |
4 | 1320121301101103 |
5 | 13114111140311 |
6 | 532240022335 |
7 | 101025620006 |
oct | 17031612123 |
9 | 5183021285 |
10 | 2020021331 |
11 | 947281a19 |
12 | 4846019ab |
13 | 2626673c3 |
14 | 1523cb53d |
15 | bc519c8b |
hex | 78671453 |
2020021331 has 4 divisors (see below), whose sum is σ = 2020111464. Its totient is φ = 2019931200.
The previous prime is 2020021321. The next prime is 2020021343. The reversal of 2020021331 is 1331200202.
It is a happy number.
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 2020021331 - 222 = 2015827027 is a prime.
It is a super-2 number, since 2×20200213312 = 8160972355390023122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020021301) 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, 17576 + ... + 65946.
It is an arithmetic number, because the mean of its divisors is an integer number (505027866).
Almost surely, 22020021331 is an apocalyptic number.
2020021331 is a deficient number, since it is larger than the sum of its proper divisors (90133).
2020021331 is an equidigital number, since it uses as much as digits as its factorization.
2020021331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90132.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2020021331 is about 44944.6474121224. The cubic root of 2020021331 is about 1264.1113144621. Note that the first 3 decimals are identical.
Adding to 2020021331 its reverse (1331200202), we get a palindrome (3351221533).
The spelling of 2020021331 in words is "two billion, twenty million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •