Base | Representation |
---|---|
bin | 11001000111101… |
… | …101110111110101 |
3 | 1002101001001020112 |
4 | 121013231313311 |
5 | 1330343001201 |
6 | 105453112405 |
7 | 13305202553 |
oct | 3107556765 |
9 | 1071031215 |
10 | 421453301 |
11 | 1a6999115 |
12 | b9188705 |
13 | 69413369 |
14 | 3dd8abd3 |
15 | 270000bb |
hex | 191eddf5 |
421453301 has 2 divisors, whose sum is σ = 421453302. Its totient is φ = 421453300.
The previous prime is 421453247. The next prime is 421453303. The reversal of 421453301 is 103354124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 385140625 + 36312676 = 19625^2 + 6026^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421453301 is a prime.
Together with 421453303, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p22417700 and since 421453301 and 22417700 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421453303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210726650 + 210726651.
It is an arithmetic number, because the mean of its divisors is an integer number (210726651).
Almost surely, 2421453301 is an apocalyptic number.
It is an amenable number.
421453301 is a deficient number, since it is larger than the sum of its proper divisors (1).
421453301 is an equidigital number, since it uses as much as digits as its factorization.
421453301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 421453301 is about 20529.3278263074. The cubic root of 421453301 is about 749.7500209862.
The spelling of 421453301 in words is "four hundred twenty-one million, four hundred fifty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •