Base | Representation |
---|---|
bin | 11101111100000000… |
… | …01101000011011101 |
3 | 1112111010111000111011 |
4 | 32332000031003131 |
5 | 230404043021042 |
6 | 11214512055221 |
7 | 1106203033042 |
oct | 167600150335 |
9 | 45433430434 |
10 | 16072626397 |
11 | 68a8640113 |
12 | 3146834511 |
13 | 1691b34329 |
14 | ac68791c9 |
15 | 64108ea17 |
hex | 3be00d0dd |
16072626397 has 2 divisors, whose sum is σ = 16072626398. Its totient is φ = 16072626396.
The previous prime is 16072626347. The next prime is 16072626431. The reversal of 16072626397 is 79362627061.
16072626397 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., 15176761636 + 895864761 = 123194^2 + 29931^2 .
It is a cyclic number.
It is not a de Polignac number, because 16072626397 - 227 = 15938408669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16072626397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16072626307) 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, 8036313198 + 8036313199.
It is an arithmetic number, because the mean of its divisors is an integer number (8036313199).
Almost surely, 216072626397 is an apocalyptic number.
It is an amenable number.
16072626397 is a deficient number, since it is larger than the sum of its proper divisors (1).
16072626397 is an equidigital number, since it uses as much as digits as its factorization.
16072626397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 49.
The spelling of 16072626397 in words is "sixteen billion, seventy-two million, six hundred twenty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •