Base | Representation |
---|---|
bin | 1100000101001… |
… | …1011100110101 |
3 | 10112100110220212 |
4 | 3001103130311 |
5 | 100433022321 |
6 | 5010035205 |
7 | 1153501016 |
oct | 301233465 |
9 | 115313825 |
10 | 50673461 |
11 | 266707a3 |
12 | 14b78b05 |
13 | a662ac7 |
14 | 6a3100d |
15 | 46ae55b |
hex | 3053735 |
50673461 has 12 divisors (see below), whose sum is σ = 52971012. Its totient is φ = 48439296.
The previous prime is 50673449. The next prime is 50673463. The reversal of 50673461 is 16437605.
50673461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 17380561 + 33292900 = 4169^2 + 5770^2 .
It is not a de Polignac number, because 50673461 - 26 = 50673397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50673463) 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 11 ways as a sum of consecutive naturals, for example, 197045 + ... + 197301.
It is an arithmetic number, because the mean of its divisors is an integer number (4414251).
Almost surely, 250673461 is an apocalyptic number.
It is an amenable number.
50673461 is a deficient number, since it is larger than the sum of its proper divisors (2297551).
50673461 is an equidigital number, since it uses as much as digits as its factorization.
50673461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 367 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
The square root of 50673461 is about 7118.5294127369. The cubic root of 50673461 is about 370.0498131132.
The spelling of 50673461 in words is "fifty million, six hundred seventy-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •