Base | Representation |
---|---|
bin | 10011111101101001111001 |
3 | 100211212200221 |
4 | 103331221321 |
5 | 2314431043 |
6 | 304100041 |
7 | 62324233 |
oct | 23755171 |
9 | 10755627 |
10 | 5233273 |
11 | 2a54921 |
12 | 1904621 |
13 | 1113016 |
14 | 9a3253 |
15 | 6d58ed |
hex | 4fda79 |
5233273 has 8 divisors (see below), whose sum is σ = 5366088. Its totient is φ = 5101824.
The previous prime is 5233271. The next prime is 5233301. The reversal of 5233273 is 3723325.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1982464 + 3250809 = 1408^2 + 1803^2 .
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 5233273 - 21 = 5233271 is a prime.
It is a d-powerful number, because it can be written as 58 + 22 + 33 + 310 + 28 + 73 + 314 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5233271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15361 + ... + 15697.
It is an arithmetic number, because the mean of its divisors is an integer number (670761).
Almost surely, 25233273 is an apocalyptic number.
5233273 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
5233273 is a deficient number, since it is larger than the sum of its proper divisors (132815).
5233273 is a wasteful number, since it uses less digits than its factorization.
5233273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683.
The product of its digits is 3780, while the sum is 25.
The square root of 5233273 is about 2287.6348047711. The cubic root of 5233273 is about 173.6165533317.
Adding to 5233273 its reverse (3723325), we get a palindrome (8956598).
The spelling of 5233273 in words is "five million, two hundred thirty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •