Base | Representation |
---|---|
bin | 11001000111101… |
… | …010111100110011 |
3 | 1002101000102211012 |
4 | 121013222330303 |
5 | 1330342110311 |
6 | 105452541135 |
7 | 13305122633 |
oct | 3107527463 |
9 | 1071012735 |
10 | 421441331 |
11 | 1a6990123 |
12 | b91817ab |
13 | 6940aa8c |
14 | 3dd866c3 |
15 | 26eeb78b |
hex | 191eaf33 |
421441331 has 2 divisors, whose sum is σ = 421441332. Its totient is φ = 421441330.
The previous prime is 421441291. The next prime is 421441333. The reversal of 421441331 is 133144124.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 421441331 - 210 = 421440307 is a prime.
It is a super-2 number, since 2×4214413312 = 355225590950103122, which contains 22 as substring.
Together with 421441333, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 421441297 and 421441306.
It is not a weakly prime, because it can be changed into another prime (421441333) 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, 210720665 + 210720666.
It is an arithmetic number, because the mean of its divisors is an integer number (210720666).
Almost surely, 2421441331 is an apocalyptic number.
421441331 is a deficient number, since it is larger than the sum of its proper divisors (1).
421441331 is an equidigital number, since it uses as much as digits as its factorization.
421441331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 23.
The square root of 421441331 is about 20529.0362900941. The cubic root of 421441331 is about 749.7429228548.
Adding to 421441331 its reverse (133144124), we get a palindrome (554585455).
The spelling of 421441331 in words is "four hundred twenty-one million, four hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •