Base | Representation |
---|---|
bin | 111100001000100… |
… | …1011101000100100 |
3 | 12012121210100002222 |
4 | 1320101023220210 |
5 | 13113022120040 |
6 | 532115451512 |
7 | 101000522300 |
oct | 17021135044 |
9 | 5177710088 |
10 | 2017770020 |
11 | 945a84532 |
12 | 4838b6b98 |
13 | 262059776 |
14 | 151da2d00 |
15 | bc222bb5 |
hex | 7844ba24 |
2017770020 has 36 divisors (see below), whose sum is σ = 4929126300. Its totient is φ = 691806528.
The previous prime is 2017769989. The next prime is 2017770061. The reversal of 2017770020 is 200777102.
It can be written as a sum of positive squares in 2 ways, for example, as 762201664 + 1255568356 = 27608^2 + 35434^2 .
It is a super-2 number, since 2×20177700202 = 8142791707221600800, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1028495 + ... + 1030454.
It is an arithmetic number, because the mean of its divisors is an integer number (136920175).
Almost surely, 22017770020 is an apocalyptic number.
2017770020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2017770020 is an abundant number, since it is smaller than the sum of its proper divisors (2911356280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2017770020 is a wasteful number, since it uses less digits than its factorization.
2017770020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2058972 (or 2058963 counting only the distinct ones).
The product of its (nonzero) digits is 1372, while the sum is 26.
The square root of 2017770020 is about 44919.5950560554. The cubic root of 2017770020 is about 1263.6415231167.
The spelling of 2017770020 in words is "two billion, seventeen million, seven hundred seventy thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •