Base | Representation |
---|---|
bin | 11110001111000101… |
… | …00101101100000101 |
3 | 1112220021120022012221 |
4 | 33013202211230011 |
5 | 231221023311031 |
6 | 11242425412341 |
7 | 1113155056612 |
oct | 170742455405 |
9 | 45807508187 |
10 | 16232635141 |
11 | 697a999048 |
12 | 319033a0b1 |
13 | 16b9028a68 |
14 | addc0b509 |
15 | 650149a11 |
hex | 3c78a5b05 |
16232635141 has 2 divisors, whose sum is σ = 16232635142. Its totient is φ = 16232635140.
The previous prime is 16232635087. The next prime is 16232635157. The reversal of 16232635141 is 14153623261.
16232635141 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., 14623823041 + 1608812100 = 120929^2 + 40110^2 .
It is a cyclic number.
It is not a de Polignac number, because 16232635141 - 221 = 16230537989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16232635097 and 16232635106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16232635241) 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, 8116317570 + 8116317571.
It is an arithmetic number, because the mean of its divisors is an integer number (8116317571).
Almost surely, 216232635141 is an apocalyptic number.
It is an amenable number.
16232635141 is a deficient number, since it is larger than the sum of its proper divisors (1).
16232635141 is an equidigital number, since it uses as much as digits as its factorization.
16232635141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 34.
The spelling of 16232635141 in words is "sixteen billion, two hundred thirty-two million, six hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •