Base | Representation |
---|---|
bin | 1000111101101101… |
… | …0100101000000000 |
3 | 20012200212220212212 |
4 | 2033123110220000 |
5 | 14412003214011 |
6 | 1034435241252 |
7 | 113426151206 |
oct | 21733245000 |
9 | 6180786785 |
10 | 2406304256 |
11 | 1025329004 |
12 | 571a49228 |
13 | 2c46b5295 |
14 | 18b821076 |
15 | e13be08b |
hex | 8f6d4a00 |
2406304256 has 40 divisors (see below), whose sum is σ = 4873846164. Its totient is φ = 1186652160.
The previous prime is 2406304217. The next prime is 2406304279. The reversal of 2406304256 is 6524036042.
It can be written as a sum of positive squares in 2 ways, for example, as 2342560000 + 63744256 = 48400^2 + 7984^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
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 3 ways as a sum of consecutive naturals, for example, 5186 + ... + 69566.
Almost surely, 22406304256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2406304256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2436923082).
2406304256 is an abundant number, since it is smaller than the sum of its proper divisors (2467541908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2406304256 is an frugal number, since it uses more digits than its factorization.
2406304256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64472 (or 64456 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 2406304256 is about 49054.0952011145. The cubic root of 2406304256 is about 1340.0371742861.
The spelling of 2406304256 in words is "two billion, four hundred six million, three hundred four thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •