Base | Representation |
---|---|
bin | 1110010010101101101 |
3 | 212210102200 |
4 | 1302111231 |
5 | 104441313 |
6 | 14012113 |
7 | 3660255 |
oct | 1622555 |
9 | 783380 |
10 | 468333 |
11 | 29a958 |
12 | 1a7039 |
13 | 135228 |
14 | c2965 |
15 | 93b73 |
hex | 7256d |
468333 has 12 divisors (see below), whose sum is σ = 716508. Its totient is φ = 293760.
The previous prime is 468323. The next prime is 468353. The reversal of 468333 is 333864.
It can be written as a sum of positive squares in 2 ways, for example, as 412164 + 56169 = 642^2 + 237^2 .
It is not a de Polignac number, because 468333 - 212 = 464237 is a prime.
It is a d-powerful number, because it can be written as 46 + 67 + 34 + 83 + 38 + 311 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 468297 and 468306.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 468333.
It is not an unprimeable number, because it can be changed into a prime (468323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1378 + ... + 1683.
It is an arithmetic number, because the mean of its divisors is an integer number (59709).
2468333 is an apocalyptic number.
It is an amenable number.
468333 is a deficient number, since it is larger than the sum of its proper divisors (248175).
468333 is a wasteful number, since it uses less digits than its factorization.
468333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3084 (or 3081 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
The square root of 468333 is about 684.3485953810. The cubic root of 468333 is about 77.6577708645.
The spelling of 468333 in words is "four hundred sixty-eight thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •