Base | Representation |
---|---|
bin | 11001000110000… |
… | …100111011001001 |
3 | 1002100020012120111 |
4 | 121012010323021 |
5 | 1330240222213 |
6 | 105435554321 |
7 | 13301432365 |
oct | 3106047311 |
9 | 1070205514 |
10 | 421023433 |
11 | 1a6725156 |
12 | b8bbb9a1 |
13 | 692c27bc |
14 | 3dcb82a5 |
15 | 26e67a3d |
hex | 19184ec9 |
421023433 has 2 divisors, whose sum is σ = 421023434. Its totient is φ = 421023432.
The previous prime is 421023419. The next prime is 421023439. The reversal of 421023433 is 334320124.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 286184889 + 134838544 = 16917^2 + 11612^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421023433 is a prime.
It is a super-2 number, since 2×4210234332 = 354521462270210978, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (421023439) 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 as a sum of consecutive naturals, namely, 210511716 + 210511717.
It is an arithmetic number, because the mean of its divisors is an integer number (210511717).
Almost surely, 2421023433 is an apocalyptic number.
It is an amenable number.
421023433 is a deficient number, since it is larger than the sum of its proper divisors (1).
421023433 is an equidigital number, since it uses as much as digits as its factorization.
421023433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 22.
The square root of 421023433 is about 20518.8555480075. The cubic root of 421023433 is about 749.4950277841.
Adding to 421023433 its reverse (334320124), we get a palindrome (755343557).
The spelling of 421023433 in words is "four hundred twenty-one million, twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •