Base | Representation |
---|---|
bin | 11111111000100… |
… | …010110110100000 |
3 | 1101021112120111200 |
4 | 133320202312200 |
5 | 2043414312022 |
6 | 125025041200 |
7 | 16153500234 |
oct | 3770426640 |
9 | 1337476450 |
10 | 534916512 |
11 | 254a45769 |
12 | 12b186200 |
13 | 86a8bb60 |
14 | 510845c4 |
15 | 31e63bac |
hex | 1fe22da0 |
534916512 has 72 divisors (see below), whose sum is σ = 1638193284. Its totient is φ = 164588544.
The previous prime is 534916477. The next prime is 534916537. The reversal of 534916512 is 215619435.
534916512 is a `hidden beast` number, since 53 + 4 + 91 + 6 + 512 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 534719376 + 197136 = 23124^2 + 444^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×5349165122 = 572271349620492288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 67693 + ... + 75180.
Almost surely, 2534916512 is an apocalyptic number.
534916512 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
534916512 is an abundant number, since it is smaller than the sum of its proper divisors (1103276772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534916512 is a wasteful number, since it uses less digits than its factorization.
534916512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142902 (or 142891 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 534916512 is about 23128.2621915266. The cubic root of 534916512 is about 811.7619077557.
The spelling of 534916512 in words is "five hundred thirty-four million, nine hundred sixteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •