Base | Representation |
---|---|
bin | 11110110011101… |
… | …101111101011000 |
3 | 1100000120220221011 |
4 | 132303231331120 |
5 | 2024304432242 |
6 | 123142223304 |
7 | 15544233331 |
oct | 3663557530 |
9 | 1300526834 |
10 | 516874072 |
11 | 245842160 |
12 | 125124b34 |
13 | 83112760 |
14 | 4c909288 |
15 | 3059cd17 |
hex | 1ecedf58 |
516874072 has 64 divisors (see below), whose sum is σ = 1144956960. Its totient is φ = 215654400.
The previous prime is 516874037. The next prime is 516874097. The reversal of 516874072 is 270478615.
It is a super-2 number, since 2×5168740722 = 534317612611722368, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 219622 + ... + 221962.
Almost surely, 2516874072 is an apocalyptic number.
516874072 is a gapful number since it is divisible by the number (52) 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 516874072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (572478480).
516874072 is an abundant number, since it is smaller than the sum of its proper divisors (628082888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516874072 is a wasteful number, since it uses less digits than its factorization.
516874072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564 (or 2560 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 40.
The square root of 516874072 is about 22734.8646796061. The cubic root of 516874072 is about 802.5305660210.
The spelling of 516874072 in words is "five hundred sixteen million, eight hundred seventy-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •