Base | Representation |
---|---|
bin | 1100010000111… |
… | …1000111101001 |
3 | 10120210112100221 |
4 | 3010033013221 |
5 | 101132122103 |
6 | 5034330041 |
7 | 1163152060 |
oct | 304170751 |
9 | 116715327 |
10 | 51442153 |
11 | 27046284 |
12 | 15289921 |
13 | a871959 |
14 | 6b911d7 |
15 | 47b21bd |
hex | 310f1e9 |
51442153 has 8 divisors (see below), whose sum is σ = 62249472. Its totient is φ = 41499456.
The previous prime is 51442133. The next prime is 51442163. The reversal of 51442153 is 35124415.
It is a happy number.
51442153 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51442153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51442133) 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, 216025 + ... + 216262.
It is an arithmetic number, because the mean of its divisors is an integer number (7781184).
Almost surely, 251442153 is an apocalyptic number.
It is an amenable number.
51442153 is a deficient number, since it is larger than the sum of its proper divisors (10807319).
51442153 is a wasteful number, since it uses less digits than its factorization.
51442153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432311.
The product of its digits is 2400, while the sum is 25.
The square root of 51442153 is about 7172.3185233228. The cubic root of 51442153 is about 371.9115896770.
Adding to 51442153 its reverse (35124415), we get a palindrome (86566568).
The spelling of 51442153 in words is "fifty-one million, four hundred forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •