Base | Representation |
---|---|
bin | 1100101010110… |
… | …1001100100110 |
3 | 10200222200221000 |
4 | 3022231030212 |
5 | 102100410324 |
6 | 5134534130 |
7 | 1213444623 |
oct | 312551446 |
9 | 120880830 |
10 | 53138214 |
11 | 27aa4588 |
12 | 15967346 |
13 | b01693c |
14 | 70b334a |
15 | 49e99c9 |
hex | 32ad326 |
53138214 has 32 divisors (see below), whose sum is σ = 120970080. Its totient is φ = 17280000.
The previous prime is 53138201. The next prime is 53138219. The reversal of 53138214 is 41283135.
It is a happy number.
53138214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53138219) 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 15 ways as a sum of consecutive naturals, for example, 9787 + ... + 14214.
It is an arithmetic number, because the mean of its divisors is an integer number (3780315).
Almost surely, 253138214 is an apocalyptic number.
53138214 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
53138214 is an abundant number, since it is smaller than the sum of its proper divisors (67831866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53138214 is a wasteful number, since it uses less digits than its factorization.
53138214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24053 (or 24047 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 53138214 is about 7289.5962851176. The cubic root of 53138214 is about 375.9548148131.
The spelling of 53138214 in words is "fifty-three million, one hundred thirty-eight thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •