Base | Representation |
---|---|
bin | 11011111100101… |
… | …001101001100101 |
3 | 1012200021210000122 |
4 | 123330221221211 |
5 | 1430013242234 |
6 | 114305451325 |
7 | 14422306643 |
oct | 3374515145 |
9 | 1180253018 |
10 | 468884069 |
11 | 2207445a5 |
12 | 111040b45 |
13 | 761ac1c4 |
14 | 463b6193 |
15 | 2b26d92e |
hex | 1bf29a65 |
468884069 has 2 divisors, whose sum is σ = 468884070. Its totient is φ = 468884068.
The previous prime is 468884041. The next prime is 468884081. The reversal of 468884069 is 960488864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 234487969 + 234396100 = 15313^2 + 15310^2 .
It is a cyclic number.
It is not a de Polignac number, because 468884069 - 216 = 468818533 is a prime.
It is a super-2 number, since 2×4688840692 = 439704540323993522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 468884069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (468884029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234442034 + 234442035.
It is an arithmetic number, because the mean of its divisors is an integer number (234442035).
Almost surely, 2468884069 is an apocalyptic number.
It is an amenable number.
468884069 is a deficient number, since it is larger than the sum of its proper divisors (1).
468884069 is an equidigital number, since it uses as much as digits as its factorization.
468884069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2654208, while the sum is 53.
The square root of 468884069 is about 21653.7310641838. The cubic root of 468884069 is about 776.8821787276.
The spelling of 468884069 in words is "four hundred sixty-eight million, eight hundred eighty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •