Base | Representation |
---|---|
bin | 1100101011000… |
… | …0000110100011 |
3 | 10201000022020210 |
4 | 3022300012203 |
5 | 102101300430 |
6 | 5135105203 |
7 | 1213524414 |
oct | 312600643 |
9 | 121008223 |
10 | 53150115 |
11 | 28002517 |
12 | 15972203 |
13 | b01c195 |
14 | 70b780b |
15 | 49ed2b0 |
hex | 32b01a3 |
53150115 has 16 divisors (see below), whose sum is σ = 85795488. Its totient is φ = 28094976.
The previous prime is 53150113. The next prime is 53150131. The reversal of 53150115 is 51105135.
It is not a de Polignac number, because 53150115 - 21 = 53150113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53150091 and 53150100.
It is not an unprimeable number, because it can be changed into a prime (53150113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13984 + ... + 17373.
It is an arithmetic number, because the mean of its divisors is an integer number (5362218).
Almost surely, 253150115 is an apocalyptic number.
53150115 is a deficient number, since it is larger than the sum of its proper divisors (32645373).
53150115 is a wasteful number, since it uses less digits than its factorization.
53150115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31478.
The product of its (nonzero) digits is 375, while the sum is 21.
The square root of 53150115 is about 7290.4125397676. The cubic root of 53150115 is about 375.9828793887.
The spelling of 53150115 in words is "fifty-three million, one hundred fifty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •