Base | Representation |
---|---|
bin | 1100101001011… |
… | …1001010010110 |
3 | 10200211010010012 |
4 | 3022113022112 |
5 | 102040013313 |
6 | 5133000222 |
7 | 1212620525 |
oct | 312271226 |
9 | 120733105 |
10 | 53047958 |
11 | 27a42797 |
12 | 15923072 |
13 | acb4832 |
14 | 708c4bc |
15 | 49ccda8 |
hex | 3297296 |
53047958 has 8 divisors (see below), whose sum is σ = 79989120. Its totient is φ = 26384920.
The previous prime is 53047949. The next prime is 53047999. The reversal of 53047958 is 85974035.
53047958 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 Curzon number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 69053 + ... + 69816.
It is an arithmetic number, because the mean of its divisors is an integer number (9998640).
Almost surely, 253047958 is an apocalyptic number.
53047958 is a deficient number, since it is larger than the sum of its proper divisors (26941162).
53047958 is a wasteful number, since it uses less digits than its factorization.
53047958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139062.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 53047958 is about 7283.4029134739. The cubic root of 53047958 is about 375.7418393492.
The spelling of 53047958 in words is "fifty-three million, forty-seven thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •