Base | Representation |
---|---|
bin | 100000001101101… |
… | …110100110010010 |
3 | 1101122222200222110 |
4 | 200031232212102 |
5 | 2101330012100 |
6 | 125344050150 |
7 | 16251626160 |
oct | 4015564622 |
9 | 1348880873 |
10 | 540469650 |
11 | 258098936 |
12 | 131003956 |
13 | 87c84636 |
14 | 51acc230 |
15 | 326ae250 |
hex | 2036e992 |
540469650 has 48 divisors (see below), whose sum is σ = 1531848384. Its totient is φ = 123535680.
The previous prime is 540469609. The next prime is 540469651. The reversal of 540469650 is 56964045.
It is a super-2 number, since 2×5404696502 = 584214885142245000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 540469599 and 540469608.
It is not an unprimeable number, because it can be changed into a prime (540469651) 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 23 ways as a sum of consecutive naturals, for example, 256317 + ... + 258416.
It is an arithmetic number, because the mean of its divisors is an integer number (31913508).
Almost surely, 2540469650 is an apocalyptic number.
540469650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
540469650 is an abundant number, since it is smaller than the sum of its proper divisors (991378734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540469650 is a wasteful number, since it uses less digits than its factorization.
540469650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514755 (or 514750 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 39.
The square root of 540469650 is about 23248.0031400548. The cubic root of 540469650 is about 814.5612955026.
The spelling of 540469650 in words is "five hundred forty million, four hundred sixty-nine thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •