Base | Representation |
---|---|
bin | 1110101000011111111110… |
… | …1010001110000001000001 |
3 | 2002222002101000102102100202 |
4 | 3222013333222032001001 |
5 | 4102100123043443212 |
6 | 54115054031054545 |
7 | 3250246655462555 |
oct | 352077752160101 |
9 | 62862330372322 |
10 | 16088941781057 |
11 | 5143311219a52 |
12 | 197a18a071455 |
13 | 8c9246cc8022 |
14 | 3d89cd475865 |
15 | 1cd79c3c60c2 |
hex | ea1ffa8e041 |
16088941781057 has 2 divisors, whose sum is σ = 16088941781058. Its totient is φ = 16088941781056.
The previous prime is 16088941781009. The next prime is 16088941781131. The reversal of 16088941781057 is 75018714988061.
16088941781057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13996510098481 + 2092431682576 = 3741191^2 + 1446524^2 .
It is a cyclic number.
It is not a de Polignac number, because 16088941781057 - 210 = 16088941780033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16088941780984 and 16088941781002.
It is not a weakly prime, because it can be changed into another prime (16088941784057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8044470890528 + 8044470890529.
It is an arithmetic number, because the mean of its divisors is an integer number (8044470890529).
Almost surely, 216088941781057 is an apocalyptic number.
It is an amenable number.
16088941781057 is a deficient number, since it is larger than the sum of its proper divisors (1).
16088941781057 is an equidigital number, since it uses as much as digits as its factorization.
16088941781057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27095040, while the sum is 65.
The spelling of 16088941781057 in words is "sixteen trillion, eighty-eight billion, nine hundred forty-one million, seven hundred eighty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •