Base | Representation |
---|---|
bin | 1100110100110111001 |
3 | 210100111222 |
4 | 1212212321 |
5 | 101422111 |
6 | 13001425 |
7 | 3400211 |
oct | 1464671 |
9 | 710458 |
10 | 420281 |
11 | 267844 |
12 | 183275 |
13 | 1193b4 |
14 | ad241 |
15 | 847db |
hex | 669b9 |
420281 has 4 divisors (see below), whose sum is σ = 421632. Its totient is φ = 418932.
The previous prime is 420271. The next prime is 420293. The reversal of 420281 is 182024.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-420281 is a prime.
It is a super-2 number, since 2×4202812 = 353272237922, which contains 22 as substring.
It is an Ulam number.
It is a Duffinian number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 420281.
It is not an unprimeable number, because it can be changed into a prime (420221) 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, 56 + ... + 918.
It is an arithmetic number, because the mean of its divisors is an integer number (105408).
2420281 is an apocalyptic number.
It is an amenable number.
420281 is a deficient number, since it is larger than the sum of its proper divisors (1351).
420281 is an equidigital number, since it uses as much as digits as its factorization.
420281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1350.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 420281 is about 648.2908297979. The cubic root of 420281 is about 74.9054215230.
The spelling of 420281 in words is "four hundred twenty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •