Base | Representation |
---|---|
bin | 1111100111111110000… |
… | …11001100111001011000 |
3 | 1220022201100100101012001 |
4 | 13303333003030321120 |
5 | 32243434333132130 |
6 | 1050343333130344 |
7 | 53533523662300 |
oct | 7637703147130 |
9 | 1808640311161 |
10 | 536854974040 |
11 | 197751700a30 |
12 | 880677899b4 |
13 | 3b81876bc18 |
14 | 1bdabc36600 |
15 | de7147a6ca |
hex | 7cff0cce58 |
536854974040 has 384 divisors, whose sum is σ = 1563013324800. Its totient is φ = 164074014720.
The previous prime is 536854973999. The next prime is 536854974109. The reversal of 536854974040 is 40479458635.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 243691579 + ... + 243693781.
It is an arithmetic number, because the mean of its divisors is an integer number (4070347200).
Almost surely, 2536854974040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 536854974040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (781506662400).
536854974040 is an abundant number, since it is smaller than the sum of its proper divisors (1026158350760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
536854974040 is a wasteful number, since it uses less digits than its factorization.
536854974040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2455 (or 2444 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 55.
The spelling of 536854974040 in words is "five hundred thirty-six billion, eight hundred fifty-four million, nine hundred seventy-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •