Base | Representation |
---|---|
bin | 110001011000010101… |
… | …000100010011011111 |
3 | 12001212011100120000011 |
4 | 301120111010103133 |
5 | 1332042002301330 |
6 | 40205135144051 |
7 | 3554631346111 |
oct | 613025042337 |
9 | 161764316004 |
10 | 53021525215 |
11 | 205392a572a |
12 | a338975027 |
13 | 4ccca4c979 |
14 | 27cdb3b3b1 |
15 | 15a4c8b82a |
hex | c585444df |
53021525215 has 32 divisors (see below), whose sum is σ = 68245405056. Its totient is φ = 39442360320.
The previous prime is 53021525203. The next prime is 53021525237. The reversal of 53021525215 is 51252512035.
It is not a de Polignac number, because 53021525215 - 229 = 52484654303 is a prime.
It is a super-2 number, since 2×530215252152 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5616139 + ... + 5625571.
It is an arithmetic number, because the mean of its divisors is an integer number (2132668908).
Almost surely, 253021525215 is an apocalyptic number.
53021525215 is a deficient number, since it is larger than the sum of its proper divisors (15223879841).
53021525215 is a wasteful number, since it uses less digits than its factorization.
53021525215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10819.
The product of its (nonzero) digits is 15000, while the sum is 31.
The spelling of 53021525215 in words is "fifty-three billion, twenty-one million, five hundred twenty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •