Base | Representation |
---|---|
bin | 1101101001101… |
… | …11010001110001 |
3 | 21222111021112222 |
4 | 12310313101301 |
5 | 213304134301 |
6 | 15210330425 |
7 | 2560262024 |
oct | 664672161 |
9 | 258437488 |
10 | 114521201 |
11 | 5970a523 |
12 | 32429a15 |
13 | 1a959232 |
14 | 112d11bb |
15 | a0c231b |
hex | 6d37471 |
114521201 has 2 divisors, whose sum is σ = 114521202. Its totient is φ = 114521200.
The previous prime is 114521171. The next prime is 114521237. The reversal of 114521201 is 102125411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72931600 + 41589601 = 8540^2 + 6449^2 .
It is an emirp because it is prime and its reverse (102125411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114521201 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 114521201.
It is not a weakly prime, because it can be changed into another prime (114521501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57260600 + 57260601.
It is an arithmetic number, because the mean of its divisors is an integer number (57260601).
Almost surely, 2114521201 is an apocalyptic number.
It is an amenable number.
114521201 is a deficient number, since it is larger than the sum of its proper divisors (1).
114521201 is an equidigital number, since it uses as much as digits as its factorization.
114521201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 114521201 is about 10701.4578913342. The cubic root of 114521201 is about 485.6185836451.
Adding to 114521201 its reverse (102125411), we get a palindrome (216646612).
The spelling of 114521201 in words is "one hundred fourteen million, five hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •