Base | Representation |
---|---|
bin | 1100110000100… |
… | …0111110101001 |
3 | 10201200210121200 |
4 | 3030020332221 |
5 | 102144423103 |
6 | 5150554413 |
7 | 1216601640 |
oct | 314107651 |
9 | 121623550 |
10 | 53514153 |
11 | 28230a80 |
12 | 15b08a09 |
13 | b118aa4 |
14 | 7170357 |
15 | 4a710a3 |
hex | 3308fa9 |
53514153 has 96 divisors (see below), whose sum is σ = 103514112. Its totient is φ = 25833600.
The previous prime is 53514137. The next prime is 53514161. The reversal of 53514153 is 35141535.
53514153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53514153 - 24 = 53514137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (53514103) 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 95 ways as a sum of consecutive naturals, for example, 1009675 + ... + 1009727.
It is an arithmetic number, because the mean of its divisors is an integer number (1078272).
Almost surely, 253514153 is an apocalyptic number.
53514153 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
53514153 is a deficient number, since it is larger than the sum of its proper divisors (49999959).
53514153 is a wasteful number, since it uses less digits than its factorization.
53514153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155 (or 152 counting only the distinct ones).
The product of its digits is 4500, while the sum is 27.
The square root of 53514153 is about 7315.3368343501. The cubic root of 53514153 is about 376.8393262604.
Adding to 53514153 its reverse (35141535), we get a palindrome (88655688).
The spelling of 53514153 in words is "fifty-three million, five hundred fourteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •