Base | Representation |
---|---|
bin | 1110111010010101… |
… | …1100000100000000 |
3 | 101022221221212220201 |
4 | 3232211130010000 |
5 | 31144203313210 |
6 | 1501105414544 |
7 | 201123111406 |
oct | 35645340400 |
9 | 11287855821 |
10 | 4002791680 |
11 | 17745206a8 |
12 | 93863a454 |
13 | 4ba38b2b4 |
14 | 29d87d476 |
15 | 18662753a |
hex | ee95c100 |
4002791680 has 36 divisors (see below), whose sum is σ = 9587940012. Its totient is φ = 1601116160.
The previous prime is 4002791677. The next prime is 4002791687. The reversal of 4002791680 is 861972004.
It can be written as a sum of positive squares in 2 ways, for example, as 2575765504 + 1427026176 = 50752^2 + 37776^2 .
It is not an unprimeable number, because it can be changed into a prime (4002791687) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1562311 + ... + 1564870.
It is an arithmetic number, because the mean of its divisors is an integer number (266331667).
Almost surely, 24002791680 is an apocalyptic number.
4002791680 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4002791680 is an abundant number, since it is smaller than the sum of its proper divisors (5585148332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4002791680 is an equidigital number, since it uses as much as digits as its factorization.
4002791680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3127202 (or 3127188 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 4002791680 is about 63267.6195221537. The cubic root of 4002791680 is about 1587.7702590699.
The spelling of 4002791680 in words is "four billion, two million, seven hundred ninety-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •