Base | Representation |
---|---|
bin | 100000001101110… |
… | …110100000100010 |
3 | 1101200001100102110 |
4 | 200031312200202 |
5 | 2101332031200 |
6 | 125344500150 |
7 | 16252122504 |
oct | 4015664042 |
9 | 1350040373 |
10 | 540502050 |
11 | 258110210 |
12 | 13101a656 |
13 | 87c962ca |
14 | 51ad9d74 |
15 | 326b8b50 |
hex | 20376822 |
540502050 has 96 divisors (see below), whose sum is σ = 1509617664. Its totient is φ = 126792000.
The previous prime is 540502043. The next prime is 540502069. The reversal of 540502050 is 50205045.
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 47 ways as a sum of consecutive naturals, for example, 45867 + ... + 56433.
It is an arithmetic number, because the mean of its divisors is an integer number (15725184).
Almost surely, 2540502050 is an apocalyptic number.
540502050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 540502050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (754808832).
540502050 is an abundant number, since it is smaller than the sum of its proper divisors (969115614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540502050 is a wasteful number, since it uses less digits than its factorization.
540502050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10624 (or 10619 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 21.
The square root of 540502050 is about 23248.6999636539. The cubic root of 540502050 is about 814.5775722468.
Adding to 540502050 its reverse (50205045), we get a palindrome (590707095).
The spelling of 540502050 in words is "five hundred forty million, five hundred two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •