Base | Representation |
---|---|
bin | 1101100101110… |
… | …11010000010001 |
3 | 21221112110201011 |
4 | 12302323100101 |
5 | 213141410301 |
6 | 15151410521 |
7 | 2553045001 |
oct | 662732021 |
9 | 257473634 |
10 | 114013201 |
11 | 593a2895 |
12 | 32223a41 |
13 | 1a80bc43 |
14 | 111dc001 |
15 | a021a51 |
hex | 6cbb411 |
114013201 has 2 divisors, whose sum is σ = 114013202. Its totient is φ = 114013200.
The previous prime is 114013189. The next prime is 114013213. The reversal of 114013201 is 102310411.
It is a balanced prime because it is at equal distance from previous prime (114013189) and next prime (114013213).
It can be written as a sum of positive squares in only one way, i.e., 111323601 + 2689600 = 10551^2 + 1640^2 .
It is a cyclic number.
It is not a de Polignac number, because 114013201 - 27 = 114013073 is a prime.
It is not a weakly prime, because it can be changed into another prime (114013261) 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, 57006600 + 57006601.
It is an arithmetic number, because the mean of its divisors is an integer number (57006601).
Almost surely, 2114013201 is an apocalyptic number.
It is an amenable number.
114013201 is a deficient number, since it is larger than the sum of its proper divisors (1).
114013201 is an equidigital number, since it uses as much as digits as its factorization.
114013201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 114013201 is about 10677.6964276009. The cubic root of 114013201 is about 484.8994739753.
Adding to 114013201 its reverse (102310411), we get a palindrome (216323612).
It can be divided in two parts, 1140 and 13201, that added together give a palindrome (14341).
The spelling of 114013201 in words is "one hundred fourteen million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •