Base | Representation |
---|---|
bin | 11001000110110… |
… | …111011010101101 |
3 | 1002100121201021111 |
4 | 121012313122231 |
5 | 1330313332003 |
6 | 105444232021 |
7 | 13303253353 |
oct | 3106673255 |
9 | 1070551244 |
10 | 421230253 |
11 | 1a6856584 |
12 | b909b611 |
13 | 69365992 |
14 | 3dd2d7d3 |
15 | 26ea8e6d |
hex | 191b76ad |
421230253 has 2 divisors, whose sum is σ = 421230254. Its totient is φ = 421230252.
The previous prime is 421230241. The next prime is 421230281. The reversal of 421230253 is 352032124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 297286564 + 123943689 = 17242^2 + 11133^2 .
It is a cyclic number.
It is not a de Polignac number, because 421230253 - 29 = 421229741 is a prime.
It is equal to p22406503 and since 421230253 and 22406503 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 (421230203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210615126 + 210615127.
It is an arithmetic number, because the mean of its divisors is an integer number (210615127).
Almost surely, 2421230253 is an apocalyptic number.
It is an amenable number.
421230253 is a deficient number, since it is larger than the sum of its proper divisors (1).
421230253 is an equidigital number, since it uses as much as digits as its factorization.
421230253 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 22.
The square root of 421230253 is about 20523.8946840019. The cubic root of 421230253 is about 749.6177328993.
Adding to 421230253 its reverse (352032124), we get a palindrome (773262377).
The spelling of 421230253 in words is "four hundred twenty-one million, two hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •