Base | Representation |
---|---|
bin | 1100110001111111100101… |
… | …0101001011000001001101 |
3 | 1211202110022012111000102212 |
4 | 3030133321111023001031 |
5 | 3320221041400232112 |
6 | 45515511353200205 |
7 | 2650203651315242 |
oct | 314377125130115 |
9 | 54673265430385 |
10 | 14053021102157 |
11 | 4528942061484 |
12 | 16ab6a0400065 |
13 | 7ac26a88618b |
14 | 3682540d95c9 |
15 | 195840b04522 |
hex | cc7f954b04d |
14053021102157 has 2 divisors, whose sum is σ = 14053021102158. Its totient is φ = 14053021102156.
The previous prime is 14053021102103. The next prime is 14053021102199. The reversal of 14053021102157 is 75120112035041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10556592326281 + 3496428775876 = 3249091^2 + 1869874^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14053021102157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14053021182157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026510551078 + 7026510551079.
It is an arithmetic number, because the mean of its divisors is an integer number (7026510551079).
Almost surely, 214053021102157 is an apocalyptic number.
It is an amenable number.
14053021102157 is a deficient number, since it is larger than the sum of its proper divisors (1).
14053021102157 is an equidigital number, since it uses as much as digits as its factorization.
14053021102157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 32.
Adding to 14053021102157 its reverse (75120112035041), we get a palindrome (89173133137198).
The spelling of 14053021102157 in words is "fourteen trillion, fifty-three billion, twenty-one million, one hundred two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •