Base | Representation |
---|---|
bin | 110001101100110101… |
… | …010010001110001111 |
3 | 12002202010122001111011 |
4 | 301230311102032033 |
5 | 1333243032441101 |
6 | 40303224110051 |
7 | 3566306252164 |
oct | 615465221617 |
9 | 162663561434 |
10 | 53365515151 |
11 | 206a5495433 |
12 | a414005327 |
13 | 50560b0400 |
14 | 28236c206b |
15 | 15c5089751 |
hex | c6cd5238f |
53365515151 has 12 divisors (see below), whose sum is σ = 57851932008. Its totient is φ = 49204550304.
The previous prime is 53365515143. The next prime is 53365515187. The reversal of 53365515151 is 15151556335.
It is not a de Polignac number, because 53365515151 - 23 = 53365515143 is a prime.
It is a super-2 number, since 2×533655151512 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53365515121) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 29580 + ... + 328033.
It is an arithmetic number, because the mean of its divisors is an integer number (4820994334).
Almost surely, 253365515151 is an apocalyptic number.
53365515151 is a deficient number, since it is larger than the sum of its proper divisors (4486416857).
53365515151 is a wasteful number, since it uses less digits than its factorization.
53365515151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358522 (or 358509 counting only the distinct ones).
The product of its digits is 168750, while the sum is 40.
It can be divided in two parts, 53365 and 515151, that added together give a square (568516 = 7542).
The spelling of 53365515151 in words is "fifty-three billion, three hundred sixty-five million, five hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •