Base | Representation |
---|---|
bin | 11001000011000… |
… | …010101110010011 |
3 | 1002021201210102112 |
4 | 121003002232103 |
5 | 1330034243422 |
6 | 105410535535 |
7 | 13261610324 |
oct | 3103025623 |
9 | 1067653375 |
10 | 420227987 |
11 | 1a6231563 |
12 | b88975ab |
13 | 690a471a |
14 | 3db4c44b |
15 | 26d5bee2 |
hex | 190c2b93 |
420227987 has 4 divisors (see below), whose sum is σ = 429169056. Its totient is φ = 411286920.
The previous prime is 420227933. The next prime is 420227993. The reversal of 420227987 is 789722024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 420227987 - 26 = 420227923 is a prime.
It is a super-2 number, since 2×4202279872 = 353183122116144338, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420227287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4470464 + ... + 4470557.
It is an arithmetic number, because the mean of its divisors is an integer number (107292264).
Almost surely, 2420227987 is an apocalyptic number.
420227987 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
420227987 is a deficient number, since it is larger than the sum of its proper divisors (8941069).
420227987 is an equidigital number, since it uses as much as digits as its factorization.
420227987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8941068.
The product of its (nonzero) digits is 112896, while the sum is 41.
The square root of 420227987 is about 20499.4630905300. The cubic root of 420227987 is about 749.0227194129.
The spelling of 420227987 in words is "four hundred twenty million, two hundred twenty-seven thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •