Base | Representation |
---|---|
bin | 1100100100110010011… |
… | …0100011111111111101 |
3 | 202122121202020000110112 |
4 | 3021030212203333331 |
5 | 12014414041322031 |
6 | 243124444315405 |
7 | 21415340544554 |
oct | 3111446437775 |
9 | 678552200415 |
10 | 216033542141 |
11 | 8368a33677a |
12 | 35a51242b65 |
13 | 174ab01a711 |
14 | a6556a4d9b |
15 | 5945d9362b |
hex | 324c9a3ffd |
216033542141 has 2 divisors, whose sum is σ = 216033542142. Its totient is φ = 216033542140.
The previous prime is 216033542119. The next prime is 216033542149. The reversal of 216033542141 is 141245330612.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138666119641 + 77367422500 = 372379^2 + 278150^2 .
It is a cyclic number.
It is not a de Polignac number, because 216033542141 - 234 = 198853672957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 216033542098 and 216033542107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (216033542149) 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, 108016771070 + 108016771071.
It is an arithmetic number, because the mean of its divisors is an integer number (108016771071).
Almost surely, 2216033542141 is an apocalyptic number.
It is an amenable number.
216033542141 is a deficient number, since it is larger than the sum of its proper divisors (1).
216033542141 is an equidigital number, since it uses as much as digits as its factorization.
216033542141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 216033542141 its reverse (141245330612), we get a palindrome (357278872753).
The spelling of 216033542141 in words is "two hundred sixteen billion, thirty-three million, five hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •