Base | Representation |
---|---|
bin | 1100101001100… |
… | …0101011000111 |
3 | 10200211102121120 |
4 | 3022120223013 |
5 | 102040213101 |
6 | 5133045023 |
7 | 1212644553 |
oct | 312305307 |
9 | 120742546 |
10 | 53054151 |
11 | 27a47407 |
12 | 15926773 |
13 | acb75b7 |
14 | 7090863 |
15 | 49ceb36 |
hex | 3298ac7 |
53054151 has 8 divisors (see below), whose sum is σ = 71794944. Its totient is φ = 34841400.
The previous prime is 53054101. The next prime is 53054159. The reversal of 53054151 is 15145035.
53054151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53054151 - 29 = 53053639 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53054159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131775 + ... + 132176.
It is an arithmetic number, because the mean of its divisors is an integer number (8974368).
Almost surely, 253054151 is an apocalyptic number.
53054151 is a deficient number, since it is larger than the sum of its proper divisors (18740793).
53054151 is a wasteful number, since it uses less digits than its factorization.
53054151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264021.
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 53054151 is about 7283.8280457463. The cubic root of 53054151 is about 375.7564605759.
Adding to 53054151 its reverse (15145035), we get a palindrome (68199186).
It can be divided in two parts, 5 and 3054151, that added together give a triangular number (3054156 = T2471).
The spelling of 53054151 in words is "fifty-three million, fifty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •