Base | Representation |
---|---|
bin | 11010100011011000… |
… | …00011010011011101 |
3 | 1100210111001120100022 |
4 | 31101230003103131 |
5 | 213143340414003 |
6 | 10314314441525 |
7 | 1013155636226 |
oct | 152154032335 |
9 | 40714046308 |
10 | 14255404253 |
11 | 6055893232 |
12 | 291a1332a5 |
13 | 14624c435c |
14 | 99339c24d |
15 | 586783738 |
hex | 351b034dd |
14255404253 has 2 divisors, whose sum is σ = 14255404254. Its totient is φ = 14255404252.
The previous prime is 14255404217. The next prime is 14255404259. The reversal of 14255404253 is 35240455241.
14255404253 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., 14066671609 + 188732644 = 118603^2 + 13738^2 .
It is a cyclic number.
It is not a de Polignac number, because 14255404253 - 28 = 14255403997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14255404259) 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, 7127702126 + 7127702127.
It is an arithmetic number, because the mean of its divisors is an integer number (7127702127).
Almost surely, 214255404253 is an apocalyptic number.
It is an amenable number.
14255404253 is a deficient number, since it is larger than the sum of its proper divisors (1).
14255404253 is an equidigital number, since it uses as much as digits as its factorization.
14255404253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 35.
Adding to 14255404253 its reverse (35240455241), we get a palindrome (49495859494).
The spelling of 14255404253 in words is "fourteen billion, two hundred fifty-five million, four hundred four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •