Base | Representation |
---|---|
bin | 11110000100010001… |
… | …10001111001111001 |
3 | 1112122221222201100022 |
4 | 33002020301321321 |
5 | 231024321431403 |
6 | 11225430420225 |
7 | 1111004410646 |
oct | 170210617171 |
9 | 45587881308 |
10 | 16141983353 |
11 | 6933802011 |
12 | 3165b01675 |
13 | 16a3309252 |
14 | ad1b70dcd |
15 | 6471ded38 |
hex | 3c2231e79 |
16141983353 has 2 divisors, whose sum is σ = 16141983354. Its totient is φ = 16141983352.
The previous prime is 16141983343. The next prime is 16141983359. The reversal of 16141983353 is 35338914161.
16141983353 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., 10793547664 + 5348435689 = 103892^2 + 73133^2 .
It is an emirp because it is prime and its reverse (35338914161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16141983353 - 214 = 16141966969 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (16141983359) 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, 8070991676 + 8070991677.
It is an arithmetic number, because the mean of its divisors is an integer number (8070991677).
Almost surely, 216141983353 is an apocalyptic number.
It is an amenable number.
16141983353 is a deficient number, since it is larger than the sum of its proper divisors (1).
16141983353 is an equidigital number, since it uses as much as digits as its factorization.
16141983353 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 44.
The spelling of 16141983353 in words is "sixteen billion, one hundred forty-one million, nine hundred eighty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •