Base | Representation |
---|---|
bin | 1110100011100100001010… |
… | …1100110111000100110001 |
3 | 2002122222112221002112221002 |
4 | 3220321002230313010301 |
5 | 4044203013300413243 |
6 | 54012113553411345 |
7 | 3241156116442652 |
oct | 350710254670461 |
9 | 62588487075832 |
10 | 16004167201073 |
11 | 51103691802a7 |
12 | 196586b269b55 |
13 | 8c125694c06c |
14 | 3d486a557529 |
15 | 1cb489b7beb8 |
hex | e8e42b37131 |
16004167201073 has 2 divisors, whose sum is σ = 16004167201074. Its totient is φ = 16004167201072.
The previous prime is 16004167200947. The next prime is 16004167201111. The reversal of 16004167201073 is 37010276140061.
It is an a-pointer prime, because the next prime (16004167201111) can be obtained adding 16004167201073 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13241680543744 + 2762486657329 = 3638912^2 + 1662073^2 .
It is a cyclic number.
It is not a de Polignac number, because 16004167201073 - 214 = 16004167184689 is a prime.
It is a super-2 number, since 2×160041672010732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16004167401073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8002083600536 + 8002083600537.
It is an arithmetic number, because the mean of its divisors is an integer number (8002083600537).
Almost surely, 216004167201073 is an apocalyptic number.
It is an amenable number.
16004167201073 is a deficient number, since it is larger than the sum of its proper divisors (1).
16004167201073 is an equidigital number, since it uses as much as digits as its factorization.
16004167201073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 16004167201073 in words is "sixteen trillion, four billion, one hundred sixty-seven million, two hundred one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •