Base | Representation |
---|---|
bin | 11000000000111… |
… | …00000010001101 |
3 | 112001001021200101 |
4 | 30000130002031 |
5 | 403032111141 |
6 | 31553331101 |
7 | 4664136526 |
oct | 1400340215 |
9 | 461037611 |
10 | 201441421 |
11 | a3787a15 |
12 | 57566a91 |
13 | 3297040c |
14 | 1ca7984d |
15 | 12a41531 |
hex | c01c08d |
201441421 has 2 divisors, whose sum is σ = 201441422. Its totient is φ = 201441420.
The previous prime is 201441407. The next prime is 201441469. The reversal of 201441421 is 124144102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 199233225 + 2208196 = 14115^2 + 1486^2 .
It is a cyclic number.
It is not a de Polignac number, because 201441421 - 211 = 201439373 is a prime.
It is a Chen prime.
It is equal to p11154412 and since 201441421 and 11154412 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 (201442421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100720710 + 100720711.
It is an arithmetic number, because the mean of its divisors is an integer number (100720711).
Almost surely, 2201441421 is an apocalyptic number.
It is an amenable number.
201441421 is a deficient number, since it is larger than the sum of its proper divisors (1).
201441421 is an equidigital number, since it uses as much as digits as its factorization.
201441421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 201441421 is about 14193.0060593237. The cubic root of 201441421 is about 586.2050994961.
Adding to 201441421 its reverse (124144102), we get a palindrome (325585523).
It can be divided in two parts, 20 and 1441421, that added together give a palindrome (1441441).
The spelling of 201441421 in words is "two hundred one million, four hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •