Base | Representation |
---|---|
bin | 100000001110001… |
… | …000011100111110 |
3 | 1101200012002020200 |
4 | 200032020130332 |
5 | 2101341404200 |
6 | 125350224330 |
7 | 16252550004 |
oct | 4016103476 |
9 | 1350162220 |
10 | 540575550 |
11 | 258160459 |
12 | 1310550a6 |
13 | 87cc08b8 |
14 | 51b18a74 |
15 | 326d0800 |
hex | 2038873e |
540575550 has 72 divisors (see below), whose sum is σ = 1491644856. Its totient is φ = 140253120.
The previous prime is 540575527. The next prime is 540575653. The reversal of 540575550 is 55575045.
It is a happy number.
540575550 is a `hidden beast` number, since 54 + 0 + 57 + 5 + 550 = 666.
It is a Curzon number.
It is a congruent number.
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 35 ways as a sum of consecutive naturals, for example, 417 + ... + 32883.
Almost surely, 2540575550 is an apocalyptic number.
540575550 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 540575550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (745822428).
540575550 is an abundant number, since it is smaller than the sum of its proper divisors (951069306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540575550 is a wasteful number, since it uses less digits than its factorization.
540575550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32522 (or 32514 counting only the distinct ones).
The product of its (nonzero) digits is 87500, while the sum is 36.
The square root of 540575550 is about 23250.2806434675. The cubic root of 540575550 is about 814.6144939309.
The spelling of 540575550 in words is "five hundred forty million, five hundred seventy-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •