Base | Representation |
---|---|
bin | 11010100010111010… |
… | …10111011010010011 |
3 | 1100210012210222102001 |
4 | 31101131113122103 |
5 | 213141344220301 |
6 | 10314100134431 |
7 | 1013111133301 |
oct | 152135273223 |
9 | 40705728361 |
10 | 14251554451 |
11 | 60536a3882 |
12 | 2918997417 |
13 | 1461776c74 |
14 | 992a79271 |
15 | 586272c01 |
hex | 351757693 |
14251554451 has 2 divisors, whose sum is σ = 14251554452. Its totient is φ = 14251554450.
The previous prime is 14251554433. The next prime is 14251554467. The reversal of 14251554451 is 15445515241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14251554451 - 27 = 14251554323 is a prime.
It is a super-2 number, since 2×142515544512 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14251554451.
It is not a weakly prime, because it can be changed into another prime (14251554431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7125777225 + 7125777226.
It is an arithmetic number, because the mean of its divisors is an integer number (7125777226).
Almost surely, 214251554451 is an apocalyptic number.
14251554451 is a deficient number, since it is larger than the sum of its proper divisors (1).
14251554451 is an equidigital number, since it uses as much as digits as its factorization.
14251554451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 80000, while the sum is 37.
The spelling of 14251554451 in words is "fourteen billion, two hundred fifty-one million, five hundred fifty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •