Base | Representation |
---|---|
bin | 11001000100100… |
… | …010101101000001 |
3 | 1002022110202201001 |
4 | 121010202231001 |
5 | 1330134333441 |
6 | 105423212001 |
7 | 13265135434 |
oct | 3104425501 |
9 | 1068422631 |
10 | 420621121 |
11 | 1a647a968 |
12 | b8a47001 |
13 | 691b164b |
14 | 3dc1181b |
15 | 26dd8731 |
hex | 19122b41 |
420621121 has 4 divisors (see below), whose sum is σ = 420697732. Its totient is φ = 420544512.
The previous prime is 420621101. The next prime is 420621127. The reversal of 420621121 is 121126024.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 180526096 + 240095025 = 13436^2 + 15495^2 .
It is a cyclic number.
It is not a de Polignac number, because 420621121 - 227 = 286403393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420621127) 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, 29376 + ... + 41281.
It is an arithmetic number, because the mean of its divisors is an integer number (105174433).
Almost surely, 2420621121 is an apocalyptic number.
It is an amenable number.
420621121 is a deficient number, since it is larger than the sum of its proper divisors (76611).
420621121 is an equidigital number, since it uses as much as digits as its factorization.
420621121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76610.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 420621121 is about 20509.0497342027. The cubic root of 420621121 is about 749.2562232312.
Adding to 420621121 its reverse (121126024), we get a palindrome (541747145).
The spelling of 420621121 in words is "four hundred twenty million, six hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •