Base | Representation |
---|---|
bin | 11010000111010101… |
… | …00100010101101101 |
3 | 1100012002100121120121 |
4 | 31003222210111231 |
5 | 212203123244003 |
6 | 10235112044541 |
7 | 1004301113656 |
oct | 150352442555 |
9 | 40162317517 |
10 | 14020134253 |
11 | 5a45000414 |
12 | 2873393751 |
13 | 142583b438 |
14 | 97003852d |
15 | 570cadcbd |
hex | 343aa456d |
14020134253 has 2 divisors, whose sum is σ = 14020134254. Its totient is φ = 14020134252.
The previous prime is 14020134229. The next prime is 14020134259. The reversal of 14020134253 is 35243102041.
14020134253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11422906884 + 2597227369 = 106878^2 + 50963^2 .
It is a cyclic number.
It is not a de Polignac number, because 14020134253 - 217 = 14020003181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14020134259) 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, 7010067126 + 7010067127.
It is an arithmetic number, because the mean of its divisors is an integer number (7010067127).
Almost surely, 214020134253 is an apocalyptic number.
It is an amenable number.
14020134253 is a deficient number, since it is larger than the sum of its proper divisors (1).
14020134253 is an equidigital number, since it uses as much as digits as its factorization.
14020134253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 14020134253 its reverse (35243102041), we get a palindrome (49263236294).
The spelling of 14020134253 in words is "fourteen billion, twenty million, one hundred thirty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •