Base | Representation |
---|---|
bin | 11111110101010… |
… | …000011001100100 |
3 | 1101012220210001022 |
4 | 133311100121210 |
5 | 2043204221000 |
6 | 124554350312 |
7 | 16143250130 |
oct | 3765203144 |
9 | 1335823038 |
10 | 534054500 |
11 | 254507061 |
12 | 12aa2b398 |
13 | 868496a5 |
14 | 50cdc3c0 |
15 | 31d43585 |
hex | 1fd50664 |
534054500 has 96 divisors (see below), whose sum is σ = 1358622720. Its totient is φ = 179587200.
The previous prime is 534054491. The next prime is 534054511. The reversal of 534054500 is 5450435.
It is a self number, because there is not a number n which added to its sum of digits gives 534054500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 184061 + ... + 186939.
It is an arithmetic number, because the mean of its divisors is an integer number (14152320).
Almost surely, 2534054500 is an apocalyptic number.
534054500 is a gapful number since it is divisible by the number (50) 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 534054500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (679311360).
534054500 is an abundant number, since it is smaller than the sum of its proper divisors (824568220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534054500 is a wasteful number, since it uses less digits than its factorization.
534054500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2958 (or 2946 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 26.
The square root of 534054500 is about 23109.6192093249. The cubic root of 534054500 is about 811.3256248930.
The spelling of 534054500 in words is "five hundred thirty-four million, fifty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •