Base | Representation |
---|---|
bin | 11000010000101… |
… | …10001000100001 |
3 | 112011221121021102 |
4 | 30020112020201 |
5 | 404044430101 |
6 | 32110004145 |
7 | 5020562306 |
oct | 1410261041 |
9 | 464847242 |
10 | 203514401 |
11 | a4973422 |
12 | 581a6655 |
13 | 33217b2c |
14 | 1d0590ad |
15 | 12d0086b |
hex | c216221 |
203514401 has 2 divisors, whose sum is σ = 203514402. Its totient is φ = 203514400.
The previous prime is 203514379. The next prime is 203514407. The reversal of 203514401 is 104415302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119333776 + 84180625 = 10924^2 + 9175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203514401 is a prime.
It is a super-2 number, since 2×2035144012 = 82836222828777602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (203514407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101757200 + 101757201.
It is an arithmetic number, because the mean of its divisors is an integer number (101757201).
Almost surely, 2203514401 is an apocalyptic number.
It is an amenable number.
203514401 is a deficient number, since it is larger than the sum of its proper divisors (1).
203514401 is an equidigital number, since it uses as much as digits as its factorization.
203514401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 203514401 is about 14265.8473635463. The cubic root of 203514401 is about 588.2090678725.
Adding to 203514401 its reverse (104415302), we get a palindrome (307929703).
Subtracting from 203514401 its reverse (104415302), we obtain a palindrome (99099099).
The spelling of 203514401 in words is "two hundred three million, five hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •