Base | Representation |
---|---|
bin | 100000010100001… |
… | …101010000000000 |
3 | 1101210011222202200 |
4 | 200110031100000 |
5 | 2102243334224 |
6 | 125444313200 |
7 | 16302231624 |
oct | 4024152000 |
9 | 1353158680 |
10 | 542168064 |
11 | 259048989 |
12 | 1316a2800 |
13 | 8842a709 |
14 | 52011184 |
15 | 328e75c9 |
hex | 2050d400 |
542168064 has 132 divisors (see below), whose sum is σ = 1585483380. Its totient is φ = 178421760.
The previous prime is 542168027. The next prime is 542168119. The reversal of 542168064 is 460861245.
It can be written as a sum of positive squares in 2 ways, for example, as 266342400 + 275825664 = 16320^2 + 16608^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 819894 + ... + 820554.
Almost surely, 2542168064 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 542168064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (792741690).
542168064 is an abundant number, since it is smaller than the sum of its proper divisors (1043315316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
542168064 is a wasteful number, since it uses less digits than its factorization.
542168064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 776 (or 755 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The square root of 542168064 is about 23284.5026573470. The cubic root of 542168064 is about 815.4136502810.
The spelling of 542168064 in words is "five hundred forty-two million, one hundred sixty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •