Base | Representation |
---|---|
bin | 11010100011010100… |
… | …10100001010111101 |
3 | 1100210110012102221001 |
4 | 31101222110022331 |
5 | 213143231332203 |
6 | 10314301010301 |
7 | 1013152032142 |
oct | 152152241275 |
9 | 40713172831 |
10 | 14254949053 |
11 | 6055602234 |
12 | 2919b53991 |
13 | 14623950c7 |
14 | 9932c03c9 |
15 | 5866e391d |
hex | 351a942bd |
14254949053 has 2 divisors, whose sum is σ = 14254949054. Its totient is φ = 14254949052.
The previous prime is 14254948999. The next prime is 14254949057. The reversal of 14254949053 is 35094945241.
14254949053 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., 12272651524 + 1982297529 = 110782^2 + 44523^2 .
It is a cyclic number.
It is not a de Polignac number, because 14254949053 - 217 = 14254817981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14254948994 and 14254949012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14254949057) 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, 7127474526 + 7127474527.
It is an arithmetic number, because the mean of its divisors is an integer number (7127474527).
Almost surely, 214254949053 is an apocalyptic number.
It is an amenable number.
14254949053 is a deficient number, since it is larger than the sum of its proper divisors (1).
14254949053 is an equidigital number, since it uses as much as digits as its factorization.
14254949053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 14254949053 in words is "fourteen billion, two hundred fifty-four million, nine hundred forty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •