Base | Representation |
---|---|
bin | 11011110011100… |
… | …000111011000111 |
3 | 1012111210002122112 |
4 | 123303200323013 |
5 | 1423410122111 |
6 | 114142251235 |
7 | 14363043221 |
oct | 3363407307 |
9 | 1174702575 |
10 | 466489031 |
11 | 21a359128 |
12 | 110286b1b |
13 | 75851018 |
14 | 45d51411 |
15 | 2ae48e8b |
hex | 1bce0ec7 |
466489031 has 4 divisors (see below), whose sum is σ = 466557864. Its totient is φ = 466420200.
The previous prime is 466489019. The next prime is 466489033. The reversal of 466489031 is 130984664.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-466489031 is a prime.
It is a super-2 number, since 2×4664890312 = 435224032086637922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 466489031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (466489033) 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 in 3 ways as a sum of consecutive naturals, for example, 22985 + ... + 38226.
It is an arithmetic number, because the mean of its divisors is an integer number (116639466).
Almost surely, 2466489031 is an apocalyptic number.
466489031 is a deficient number, since it is larger than the sum of its proper divisors (68833).
466489031 is an equidigital number, since it uses as much as digits as its factorization.
466489031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68832.
The product of its (nonzero) digits is 124416, while the sum is 41.
The square root of 466489031 is about 21598.3571365972. The cubic root of 466489031 is about 775.5571607806.
The spelling of 466489031 in words is "four hundred sixty-six million, four hundred eighty-nine thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •