Base | Representation |
---|---|
bin | 1100101000111… |
… | …1011010010111 |
3 | 10200202111120112 |
4 | 3022033122113 |
5 | 102033004330 |
6 | 5132153235 |
7 | 1212426140 |
oct | 312173227 |
9 | 120674515 |
10 | 53016215 |
11 | 27a2095a |
12 | 1590881b |
13 | aca3255 |
14 | 7080ac7 |
15 | 49c3795 |
hex | 328f697 |
53016215 has 8 divisors (see below), whose sum is σ = 72708000. Its totient is φ = 36353952.
The previous prime is 53016193. The next prime is 53016221. The reversal of 53016215 is 51261035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53016215 - 26 = 53016151 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 757340 + ... + 757409.
It is an arithmetic number, because the mean of its divisors is an integer number (9088500).
Almost surely, 253016215 is an apocalyptic number.
53016215 is a deficient number, since it is larger than the sum of its proper divisors (19691785).
53016215 is a wasteful number, since it uses less digits than its factorization.
53016215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514761.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 53016215 is about 7281.2234548872. The cubic root of 53016215 is about 375.6668785435. Note that the first 3 decimals are identical.
The spelling of 53016215 in words is "fifty-three million, sixteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •