Base | Representation |
---|---|
bin | 1111000010001111100… |
… | …01111010011100000000 |
3 | 1211101102202200110211002 |
4 | 13201013301322130000 |
5 | 31430444141423042 |
6 | 1033153430111132 |
7 | 52215560312600 |
oct | 7410761723400 |
9 | 1741382613732 |
10 | 516600342272 |
11 | 18a0a8475333 |
12 | 841544ab4a8 |
13 | 3993b3bc601 |
14 | 1b009bcac00 |
15 | d6881b3132 |
hex | 7847c7a700 |
516600342272 has 108 divisors (see below), whose sum is σ = 1202322015216. Its totient is φ = 220886507520.
The previous prime is 516600342263. The next prime is 516600342277. The reversal of 516600342272 is 272243006615.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516600342277) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5383997 + ... + 5479107.
It is an arithmetic number, because the mean of its divisors is an integer number (11132611252).
Almost surely, 2516600342272 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 516600342272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (601161007608).
516600342272 is an abundant number, since it is smaller than the sum of its proper divisors (685721672944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516600342272 is an equidigital number, since it uses as much as digits as its factorization.
516600342272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95574 (or 95553 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 38.
Adding to 516600342272 its reverse (272243006615), we get a palindrome (788843348887).
The spelling of 516600342272 in words is "five hundred sixteen billion, six hundred million, three hundred forty-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •