Base | Representation |
---|---|
bin | 1100101010111… |
… | …0111011110101 |
3 | 10201000001200200 |
4 | 3022232323311 |
5 | 102101122313 |
6 | 5135031113 |
7 | 1213504443 |
oct | 312567365 |
9 | 121001620 |
10 | 53145333 |
11 | 27aa996a |
12 | 1596b499 |
13 | b019c57 |
14 | 70b5b93 |
15 | 49ebb73 |
hex | 32aeef5 |
53145333 has 6 divisors (see below), whose sum is σ = 76765494. Its totient is φ = 35430216.
The previous prime is 53145331. The next prime is 53145343. The reversal of 53145333 is 33354135.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 44395569 + 8749764 = 6663^2 + 2958^2 .
It is not a de Polignac number, because 53145333 - 21 = 53145331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53145297 and 53145306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53145331) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 2952510 + ... + 2952527.
It is an arithmetic number, because the mean of its divisors is an integer number (12794249).
Almost surely, 253145333 is an apocalyptic number.
It is an amenable number.
53145333 is a deficient number, since it is larger than the sum of its proper divisors (23620161).
53145333 is a wasteful number, since it uses less digits than its factorization.
53145333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5905043 (or 5905040 counting only the distinct ones).
The product of its digits is 8100, while the sum is 27.
The square root of 53145333 is about 7290.0845674107. The cubic root of 53145333 is about 375.9716031255.
Adding to 53145333 its reverse (33354135), we get a palindrome (86499468).
The spelling of 53145333 in words is "fifty-three million, one hundred forty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •