Base | Representation |
---|---|
bin | 1100011110010… |
… | …0000001101111 |
3 | 10122102211121211 |
4 | 3013210001233 |
5 | 101343023343 |
6 | 5105135251 |
7 | 1203443413 |
oct | 307440157 |
9 | 118384554 |
10 | 52314223 |
11 | 275914a5 |
12 | 1562a527 |
13 | aab8880 |
14 | 6d3ad43 |
15 | 48d579d |
hex | 31e406f |
52314223 has 8 divisors (see below), whose sum is σ = 56856800. Its totient is φ = 47845728.
The previous prime is 52314217. The next prime is 52314281. The reversal of 52314223 is 32241325.
52314223 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 not a de Polignac number, because 52314223 - 25 = 52314191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52314194 and 52314203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52314293) 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, 17043 + ... + 19876.
It is an arithmetic number, because the mean of its divisors is an integer number (7107100).
Almost surely, 252314223 is an apocalyptic number.
52314223 is a deficient number, since it is larger than the sum of its proper divisors (4542577).
52314223 is a wasteful number, since it uses less digits than its factorization.
52314223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37041.
The product of its digits is 1440, while the sum is 22.
The square root of 52314223 is about 7232.8571809486. The cubic root of 52314223 is about 374.0014274493.
Adding to 52314223 its reverse (32241325), we get a palindrome (84555548).
The spelling of 52314223 in words is "fifty-two million, three hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •