Base | Representation |
---|---|
bin | 111100001101010… |
… | …1000100000000001 |
3 | 12012210110012122110 |
4 | 1320122220200001 |
5 | 13114140410203 |
6 | 532244525533 |
7 | 101030551362 |
oct | 17032504001 |
9 | 5183405573 |
10 | 2020247553 |
11 | 947416985 |
12 | 4846b08a9 |
13 | 26271636c |
14 | 152449b69 |
15 | bc561d03 |
hex | 786a8801 |
2020247553 has 8 divisors (see below), whose sum is σ = 2696738368. Its totient is φ = 1345294224.
The previous prime is 2020247539. The next prime is 2020247557. The reversal of 2020247553 is 3557420202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2020247553 - 229 = 1483376641 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2020247553.
It is not an unprimeable number, because it can be changed into a prime (2020247557) 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, 381301 + ... + 386562.
It is an arithmetic number, because the mean of its divisors is an integer number (337092296).
Almost surely, 22020247553 is an apocalyptic number.
It is an amenable number.
2020247553 is a deficient number, since it is larger than the sum of its proper divisors (676490815).
2020247553 is an equidigital number, since it uses as much as digits as its factorization.
2020247553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768743.
The product of its (nonzero) digits is 16800, while the sum is 30.
The square root of 2020247553 is about 44947.1640150967. The cubic root of 2020247553 is about 1264.1585019366.
Adding to 2020247553 its reverse (3557420202), we get a palindrome (5577667755).
The spelling of 2020247553 in words is "two billion, twenty million, two hundred forty-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •