Base | Representation |
---|---|
bin | 1001100011111111101000 |
3 | 11201100120210 |
4 | 21203333220 |
5 | 1120203403 |
6 | 125421120 |
7 | 30210150 |
oct | 11437750 |
9 | 4640523 |
10 | 2506728 |
11 | 1462384 |
12 | a0a7a0 |
13 | 699c93 |
14 | 493760 |
15 | 347b03 |
hex | 263fe8 |
2506728 has 64 divisors (see below), whose sum is σ = 7349760. Its totient is φ = 697536.
The previous prime is 2506723. The next prime is 2506729. The reversal of 2506728 is 8276052.
It is a junction number, because it is equal to n+sod(n) for n = 2506695 and 2506704.
It is not an unprimeable number, because it can be changed into a prime (2506723) 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 15 ways as a sum of consecutive naturals, for example, 7051 + ... + 7397.
It is an arithmetic number, because the mean of its divisors is an integer number (114840).
22506728 is an apocalyptic number.
2506728 is a gapful number since it is divisible by the number (28) 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 2506728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3674880).
2506728 is an abundant number, since it is smaller than the sum of its proper divisors (4843032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2506728 is a wasteful number, since it uses less digits than its factorization.
2506728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 402 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 2506728 is about 1583.2649809808. The cubic root of 2506728 is about 135.8425224524.
The spelling of 2506728 in words is "two million, five hundred six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •