Base | Representation |
---|---|
bin | 1100011001101… |
… | …0110110001010 |
3 | 10121212121110000 |
4 | 3012122312022 |
5 | 101303430344 |
6 | 5054503430 |
7 | 1201054461 |
oct | 306326612 |
9 | 117777400 |
10 | 52014474 |
11 | 273a7276 |
12 | 15504b76 |
13 | aa122c5 |
14 | 6c9d9d8 |
15 | 4876a69 |
hex | 319ad8a |
52014474 has 20 divisors (see below), whose sum is σ = 116551314. Its totient is φ = 17338104.
The previous prime is 52014463. The next prime is 52014491. The reversal of 52014474 is 47441025.
52014474 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 only one way, i.e., 36687249 + 15327225 = 6057^2 + 3915^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon 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 9 ways as a sum of consecutive naturals, for example, 160377 + ... + 160700.
Almost surely, 252014474 is an apocalyptic number.
52014474 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
52014474 is an abundant number, since it is smaller than the sum of its proper divisors (64536840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52014474 is a wasteful number, since it uses less digits than its factorization.
52014474 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321091 (or 321082 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 27.
The square root of 52014474 is about 7212.1060724313. The cubic root of 52014474 is about 373.2857434732.
Adding to 52014474 its reverse (47441025), we get a palindrome (99455499).
The spelling of 52014474 in words is "fifty-two million, fourteen thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •