Base | Representation |
---|---|
bin | 1111000011010101110010… |
… | …1000001001100001100001 |
3 | 2011121011121100101102221211 |
4 | 3300311130220021201201 |
5 | 4132124012113121004 |
6 | 55110554411350121 |
7 | 3325462663364062 |
oct | 360653450114141 |
9 | 64534540342854 |
10 | 16550063020129 |
11 | 530092a12a971 |
12 | 1a3361a752341 |
13 | 93088346c602 |
14 | 413054d98569 |
15 | 1da789ba1504 |
hex | f0d5ca09861 |
16550063020129 has 2 divisors, whose sum is σ = 16550063020130. Its totient is φ = 16550063020128.
The previous prime is 16550063020061. The next prime is 16550063020193. The reversal of 16550063020129 is 92102036005561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13165758256225 + 3384304763904 = 3628465^2 + 1839648^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16550063020129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16550063020091 and 16550063020100.
It is not a weakly prime, because it can be changed into another prime (16550063024129) 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, 8275031510064 + 8275031510065.
It is an arithmetic number, because the mean of its divisors is an integer number (8275031510065).
Almost surely, 216550063020129 is an apocalyptic number.
It is an amenable number.
16550063020129 is a deficient number, since it is larger than the sum of its proper divisors (1).
16550063020129 is an equidigital number, since it uses as much as digits as its factorization.
16550063020129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 40.
The spelling of 16550063020129 in words is "sixteen trillion, five hundred fifty billion, sixty-three million, twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •