Base | Representation |
---|---|
bin | 11010001011010000… |
… | …01000100001000001 |
3 | 1100021101021221002101 |
4 | 31011220020201001 |
5 | 212240040103213 |
6 | 10242245350401 |
7 | 1005150646342 |
oct | 150550104101 |
9 | 40241257071 |
10 | 14053050433 |
11 | 5a61642874 |
12 | 2882408401 |
13 | 142c5c4876 |
14 | 9745660c9 |
15 | 573b11bdd |
hex | 345a08841 |
14053050433 has 2 divisors, whose sum is σ = 14053050434. Its totient is φ = 14053050432.
The previous prime is 14053050383. The next prime is 14053050457. The reversal of 14053050433 is 33405035041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12417090624 + 1635959809 = 111432^2 + 40447^2 .
It is a cyclic number.
It is not a de Polignac number, because 14053050433 - 233 = 5463115841 is a prime.
It is not a weakly prime, because it can be changed into another prime (14053000433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026525216 + 7026525217.
It is an arithmetic number, because the mean of its divisors is an integer number (7026525217).
Almost surely, 214053050433 is an apocalyptic number.
It is an amenable number.
14053050433 is a deficient number, since it is larger than the sum of its proper divisors (1).
14053050433 is an equidigital number, since it uses as much as digits as its factorization.
14053050433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 14053050433 its reverse (33405035041), we get a palindrome (47458085474).
The spelling of 14053050433 in words is "fourteen billion, fifty-three million, fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •