Base | Representation |
---|---|
bin | 11010100011001111… |
… | …00000000101111101 |
3 | 1100210101210222010112 |
4 | 31101213200011331 |
5 | 213143034231303 |
6 | 10314233115405 |
7 | 1013142540536 |
oct | 152147400575 |
9 | 40711728115 |
10 | 14254211453 |
11 | 6055149049 |
12 | 2919858b65 |
13 | 1462197461 |
14 | 99316b68d |
15 | 5865ea0d8 |
hex | 3519e017d |
14254211453 has 2 divisors, whose sum is σ = 14254211454. Its totient is φ = 14254211452.
The previous prime is 14254211381. The next prime is 14254211467. The reversal of 14254211453 is 35411245241.
14254211453 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., 7705679524 + 6548531929 = 87782^2 + 80923^2 .
It is a cyclic number.
It is not a de Polignac number, because 14254211453 - 28 = 14254211197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14254214453) 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, 7127105726 + 7127105727.
It is an arithmetic number, because the mean of its divisors is an integer number (7127105727).
Almost surely, 214254211453 is an apocalyptic number.
It is an amenable number.
14254211453 is a deficient number, since it is larger than the sum of its proper divisors (1).
14254211453 is an equidigital number, since it uses as much as digits as its factorization.
14254211453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19200, while the sum is 32.
Adding to 14254211453 its reverse (35411245241), we get a palindrome (49665456694).
The spelling of 14254211453 in words is "fourteen billion, two hundred fifty-four million, two hundred eleven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •