Base | Representation |
---|---|
bin | 1100101000111… |
… | …0001110000101 |
3 | 10200202020212201 |
4 | 3022032032011 |
5 | 102032330313 |
6 | 5132114501 |
7 | 1212405664 |
oct | 312161605 |
9 | 120666781 |
10 | 53011333 |
11 | 27a18221 |
12 | 15905a31 |
13 | aca0c6b |
14 | 707cddb |
15 | 49c20dd |
hex | 328e385 |
53011333 has 8 divisors (see below), whose sum is σ = 56609280. Its totient is φ = 49531440.
The previous prime is 53011327. The next prime is 53011339. The reversal of 53011333 is 33311035.
It is an interprime number because it is at equal distance from previous prime (53011327) and next prime (53011339).
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 53011333 - 221 = 50914181 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53011333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53011339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28585 + ... + 30382.
It is an arithmetic number, because the mean of its divisors is an integer number (7076160).
Almost surely, 253011333 is an apocalyptic number.
It is an amenable number.
53011333 is a deficient number, since it is larger than the sum of its proper divisors (3597947).
53011333 is a wasteful number, since it uses less digits than its factorization.
53011333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59027.
The product of its (nonzero) digits is 405, while the sum is 19.
The square root of 53011333 is about 7280.8882013117. Note that the first 3 decimals coincide. The cubic root of 53011333 is about 375.6553470904.
Adding to 53011333 its reverse (33311035), we get a palindrome (86322368).
The spelling of 53011333 in words is "fifty-three million, eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •