Base | Representation |
---|---|
bin | 1111000001001111110… |
… | …11110000100000111000 |
3 | 1211100001112022201120010 |
4 | 13200213323300200320 |
5 | 31423400402132102 |
6 | 1033024422301520 |
7 | 52166412031500 |
oct | 7404773604070 |
9 | 1740045281503 |
10 | 516066052152 |
11 | 189953918252 |
12 | 840255878a0 |
13 | 398847bc901 |
14 | 1ad98c6aa00 |
15 | d656324d6c |
hex | 7827ef0838 |
516066052152 has 96 divisors (see below), whose sum is σ = 1517667613200. Its totient is φ = 145790701056.
The previous prime is 516066052147. The next prime is 516066052181. The reversal of 516066052152 is 251250660615.
It is a happy number.
It is a super-2 number, since 2×5160660521522 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 516066052152.
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 23 ways as a sum of consecutive naturals, for example, 2360683 + ... + 2570010.
Almost surely, 2516066052152 is an apocalyptic number.
It is an amenable number.
516066052152 is an abundant number, since it is smaller than the sum of its proper divisors (1001601561048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516066052152 is a wasteful number, since it uses less digits than its factorization.
516066052152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4930805 (or 4930794 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 516066052152 in words is "five hundred sixteen billion, sixty-six million, fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •