Base | Representation |
---|---|
bin | 111010000010011001101111… |
… | …0110000011110011100111000 |
3 | 2110221112122220011001221112110 |
4 | 1310010303132300132130320 |
5 | 1013403042232303132102 |
6 | 5005430032052012320 |
7 | 212346443605334046 |
oct | 16404633660363470 |
9 | 2427478804057473 |
10 | 510503550052152 |
11 | 138731381227a88 |
12 | 4930b0120010a0 |
13 | 18bb13802ac647 |
14 | 900c70a079396 |
15 | 3e0457ee6b86c |
hex | 1d04cdec1e738 |
510503550052152 has 16 divisors (see below), whose sum is σ = 1276258875130440. Its totient is φ = 170167850017376.
The previous prime is 510503550052129. The next prime is 510503550052169. The reversal of 510503550052152 is 251250055305015.
It is a super-2 number, since 2×5105035500521522 (a number of 30 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 510503550052152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10635490626063 + ... + 10635490626110.
Almost surely, 2510503550052152 is an apocalyptic number.
It is an amenable number.
510503550052152 is an abundant number, since it is smaller than the sum of its proper divisors (765755325078288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
510503550052152 is a wasteful number, since it uses less digits than its factorization.
510503550052152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21270981252182 (or 21270981252178 counting only the distinct ones).
The product of its (nonzero) digits is 187500, while the sum is 39.
The spelling of 510503550052152 in words is "five hundred ten trillion, five hundred three billion, five hundred fifty million, fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •