Base | Representation |
---|---|
bin | 100000001100101… |
… | …101011010100000 |
3 | 1101122111010201210 |
4 | 200030231122200 |
5 | 2101242441111 |
6 | 125334230120 |
7 | 16246434600 |
oct | 4014553240 |
9 | 1348433653 |
10 | 540202656 |
11 | 257a26284 |
12 | 130ab5340 |
13 | 87bbcc56 |
14 | 51a5cc00 |
15 | 3265a0a6 |
hex | 2032d6a0 |
540202656 has 144 divisors (see below), whose sum is σ = 1721611584. Its totient is φ = 147603456.
The previous prime is 540202639. The next prime is 540202681. The reversal of 540202656 is 656202045.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 105696 + ... + 110688.
It is an arithmetic number, because the mean of its divisors is an integer number (11955636).
Almost surely, 2540202656 is an apocalyptic number.
540202656 is a gapful number since it is divisible by the number (56) 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 540202656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (860805792).
540202656 is an abundant number, since it is smaller than the sum of its proper divisors (1181408928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540202656 is a wasteful number, since it uses less digits than its factorization.
540202656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5043 (or 5028 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 540202656 is about 23242.2601310630. The cubic root of 540202656 is about 814.4271413148.
The spelling of 540202656 in words is "five hundred forty million, two hundred two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •