Base | Representation |
---|---|
bin | 1110011011000101101 |
3 | 220000022111 |
4 | 1303120231 |
5 | 110110441 |
6 | 14044021 |
7 | 4005622 |
oct | 1633055 |
9 | 800274 |
10 | 472621 |
11 | 2a30a6 |
12 | 1a9611 |
13 | 137176 |
14 | c4349 |
15 | 95081 |
hex | 7362d |
472621 has 4 divisors (see below), whose sum is σ = 474012. Its totient is φ = 471232.
The previous prime is 472597. The next prime is 472631. The reversal of 472621 is 126274.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 260100 + 212521 = 510^2 + 461^2 .
It is a cyclic number.
It is not a de Polignac number, because 472621 - 215 = 439853 is a prime.
It is a Duffinian number.
It is a zygodrome in base 3.
It is a junction number, because it is equal to n+sod(n) for n = 472592 and 472601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (472631) 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 3 ways as a sum of consecutive naturals, for example, 195 + ... + 991.
It is an arithmetic number, because the mean of its divisors is an integer number (118503).
2472621 is an apocalyptic number.
It is an amenable number.
472621 is a deficient number, since it is larger than the sum of its proper divisors (1391).
472621 is an equidigital number, since it uses as much as digits as its factorization.
472621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1390.
The product of its digits is 672, while the sum is 22.
The square root of 472621 is about 687.4743631584. The cubic root of 472621 is about 77.8940595506.
Adding to 472621 its reverse (126274), we get a palindrome (598895).
The spelling of 472621 in words is "four hundred seventy-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •