Base | Representation |
---|---|
bin | 110001010111111110… |
… | …000101110010111111 |
3 | 12001211202000112201200 |
4 | 301113332011302333 |
5 | 1332033432031030 |
6 | 40204402110543 |
7 | 3554526221550 |
oct | 612776056277 |
9 | 161752015650 |
10 | 53015502015 |
11 | 20535961383 |
12 | a33694b453 |
13 | 4ccb721248 |
14 | 27cd010327 |
15 | 15a449bd60 |
hex | c57f85cbf |
53015502015 has 24 divisors (see below), whose sum is σ = 105021185568. Its totient is φ = 24235657920.
The previous prime is 53015501939. The next prime is 53015502037. The reversal of 53015502015 is 51020551035.
It is not a de Polignac number, because 53015502015 - 212 = 53015497919 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53015502015.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 84151276 + ... + 84151905.
It is an arithmetic number, because the mean of its divisors is an integer number (4375882732).
Almost surely, 253015502015 is an apocalyptic number.
53015502015 is a deficient number, since it is larger than the sum of its proper divisors (52005683553).
53015502015 is a wasteful number, since it uses less digits than its factorization.
53015502015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168303199 (or 168303196 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 53015502015 in words is "fifty-three billion, fifteen million, five hundred two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.994 sec. • engine limits •