Base | Representation |
---|---|
bin | 11001000011001… |
… | …101110100100001 |
3 | 1002021211002210000 |
4 | 121003031310201 |
5 | 1330042222231 |
6 | 105411530213 |
7 | 13262160000 |
oct | 3103156441 |
9 | 1067732700 |
10 | 420273441 |
11 | 1a6262725 |
12 | b88b9969 |
13 | 690bc313 |
14 | 3db60c37 |
15 | 26d6a6e6 |
hex | 190cdd21 |
420273441 has 50 divisors (see below), whose sum is σ = 732747202. Its totient is φ = 240045120.
The previous prime is 420273433. The next prime is 420273449. The reversal of 420273441 is 144372024.
It is an interprime number because it is at equal distance from previous prime (420273433) and next prime (420273449).
It can be written as a sum of positive squares in only one way, i.e., 376515216 + 43758225 = 19404^2 + 6615^2 .
It is not a de Polignac number, because 420273441 - 23 = 420273433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420273449) 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 49 ways as a sum of consecutive naturals, for example, 193401 + ... + 195561.
Almost surely, 2420273441 is an apocalyptic number.
420273441 is the 12966-th heptagonal number.
It is an amenable number.
420273441 is a deficient number, since it is larger than the sum of its proper divisors (312473761).
420273441 is an frugal number, since it uses more digits than its factorization.
420273441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2201 (or 2171 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 27.
The square root of 420273441 is about 20500.5717237349. The cubic root of 420273441 is about 749.0497244771.
The spelling of 420273441 in words is "four hundred twenty million, two hundred seventy-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •