Base | Representation |
---|---|
bin | 1010100001110010… |
… | …0111110010000000 |
3 | 21021221202111110020 |
4 | 2220130213302000 |
5 | 21241433402024 |
6 | 1144232333440 |
7 | 130014146325 |
oct | 25034476200 |
9 | 7257674406 |
10 | 2826075264 |
11 | 12202781a1 |
12 | 66a544280 |
13 | 3606599ac |
14 | 1cb490b4c |
15 | 11818a979 |
hex | a8727c80 |
2826075264 has 128 divisors (see below), whose sum is σ = 7634088000. Its totient is φ = 926208000.
The previous prime is 2826075229. The next prime is 2826075311. The reversal of 2826075264 is 4625706282.
It is a tau number, because it is divible by the number of its divisors (128).
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 15 ways as a sum of consecutive naturals, for example, 10505722 + ... + 10505990.
Almost surely, 22826075264 is an apocalyptic number.
2826075264 is a gapful number since it is divisible by the number (24) 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 2826075264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3817044000).
2826075264 is an abundant number, since it is smaller than the sum of its proper divisors (4808012736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2826075264 is a wasteful number, since it uses less digits than its factorization.
2826075264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646 (or 634 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 42.
The square root of 2826075264 is about 53160.8433341684. The cubic root of 2826075264 is about 1413.8214768879.
The spelling of 2826075264 in words is "two billion, eight hundred twenty-six million, seventy-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •