Base | Representation |
---|---|
bin | 11011110011100… |
… | …101000100100101 |
3 | 1012111210221221210 |
4 | 123303211010211 |
5 | 1423411143041 |
6 | 114142502033 |
7 | 14363143602 |
oct | 3363450445 |
9 | 1174727853 |
10 | 466506021 |
11 | 21a36a973 |
12 | 110294919 |
13 | 75858987 |
14 | 45d576a9 |
15 | 2ae4e016 |
hex | 1bce5125 |
466506021 has 4 divisors (see below), whose sum is σ = 622008032. Its totient is φ = 311004012.
The previous prime is 466505999. The next prime is 466506043. The reversal of 466506021 is 120605664.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (466505999) and next prime (466506043).
It is not a de Polignac number, because 466506021 - 26 = 466505957 is a prime.
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 466506021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (466506071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77751001 + ... + 77751006.
It is an arithmetic number, because the mean of its divisors is an integer number (155502008).
Almost surely, 2466506021 is an apocalyptic number.
It is an amenable number.
466506021 is a deficient number, since it is larger than the sum of its proper divisors (155502011).
466506021 is a wasteful number, since it uses less digits than its factorization.
466506021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155502010.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 466506021 is about 21598.7504499682. The cubic root of 466506021 is about 775.5665761905.
The spelling of 466506021 in words is "four hundred sixty-six million, five hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •