Base | Representation |
---|---|
bin | 1001110100011111… |
… | …0101011101001000 |
3 | 20210201020120122202 |
4 | 2131013311131020 |
5 | 20344313424442 |
6 | 1113324135332 |
7 | 122216166212 |
oct | 23507653510 |
9 | 6721216582 |
10 | 2636076872 |
11 | 1132aa6630 |
12 | 616997548 |
13 | 330194c00 |
14 | 1b01535b2 |
15 | 106659c32 |
hex | 9d1f5748 |
2636076872 has 144 divisors (see below), whose sum is σ = 6174668880. Its totient is φ = 1045699200.
The previous prime is 2636076857. The next prime is 2636076881. The reversal of 2636076872 is 2786706362.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 5368547 + ... + 5369037.
It is an arithmetic number, because the mean of its divisors is an integer number (42879645).
Almost surely, 22636076872 is an apocalyptic number.
2636076872 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2636076872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3087334440).
2636076872 is an abundant number, since it is smaller than the sum of its proper divisors (3538592008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2636076872 is a wasteful number, since it uses less digits than its factorization.
2636076872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 572 (or 536 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 47.
The square root of 2636076872 is about 51342.7392335080. The cubic root of 2636076872 is about 1381.3996986541.
The spelling of 2636076872 in words is "two billion, six hundred thirty-six million, seventy-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •