Base | Representation |
---|---|
bin | 111010101010101000011011… |
… | …1000000110100110101100100 |
3 | 2111200010020110212221101112022 |
4 | 1311111100313000310311210 |
5 | 1020114134333313034413 |
6 | 5025302043422442312 |
7 | 213460062133403150 |
oct | 16525206700646544 |
9 | 2450106425841468 |
10 | 516032653643108 |
11 | 13a473246046648 |
12 | 49a62703733398 |
13 | 191c2893c496c4 |
14 | 9160183dca060 |
15 | 3e9d2d837c608 |
hex | 1d55437034d64 |
516032653643108 has 12 divisors (see below), whose sum is σ = 1032065307286272. Its totient is φ = 221156851561320.
The previous prime is 516032653643053. The next prime is 516032653643113. The reversal of 516032653643108 is 801346356230615.
516032653643108 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 516032653643108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9214868815028 + ... + 9214868815083.
It is an arithmetic number, because the mean of its divisors is an integer number (86005442273856).
Almost surely, 2516032653643108 is an apocalyptic number.
It is an amenable number.
516032653643108 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516032653643108 is a wasteful number, since it uses less digits than its factorization.
516032653643108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18429737630122 (or 18429737630120 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 53.
The spelling of 516032653643108 in words is "five hundred sixteen trillion, thirty-two billion, six hundred fifty-three million, six hundred forty-three thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •