Base | Representation |
---|---|
bin | 11111110111100… |
… | …001110010110000 |
3 | 1101021001000222001 |
4 | 133313201302300 |
5 | 2043332300112 |
6 | 125015223344 |
7 | 16151310310 |
oct | 3767416260 |
9 | 1337030861 |
10 | 534650032 |
11 | 254883534 |
12 | 12b077b54 |
13 | 869c7787 |
14 | 51015440 |
15 | 31e0ec57 |
hex | 1fde1cb0 |
534650032 has 80 divisors (see below), whose sum is σ = 1238045760. Its totient is φ = 218824704.
The previous prime is 534650027. The next prime is 534650033. The reversal of 534650032 is 230056435.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (534650033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 314208 + ... + 315904.
It is an arithmetic number, because the mean of its divisors is an integer number (15475572).
Almost surely, 2534650032 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 534650032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (619022880).
534650032 is an abundant number, since it is smaller than the sum of its proper divisors (703395728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534650032 is a wasteful number, since it uses less digits than its factorization.
534650032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838 (or 1832 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 534650032 is about 23122.5005568169. The cubic root of 534650032 is about 811.6270865643.
The spelling of 534650032 in words is "five hundred thirty-four million, six hundred fifty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •