Base | Representation |
---|---|
bin | 1111000001001000111110… |
… | …0110001001000011001001 |
3 | 2011110120001000210010012022 |
4 | 3300102033212021003021 |
5 | 4131014103414114444 |
6 | 55041343515054225 |
7 | 3322654165213343 |
oct | 360221746110311 |
9 | 64416030703168 |
10 | 16512263426249 |
11 | 52968a2259588 |
12 | 1a2822b741375 |
13 | 92a13b231506 |
14 | 4112aab32293 |
15 | 1d97c64669ee |
hex | f048f9890c9 |
16512263426249 has 2 divisors, whose sum is σ = 16512263426250. Its totient is φ = 16512263426248.
The previous prime is 16512263426221. The next prime is 16512263426257. The reversal of 16512263426249 is 94262436221561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14842565286025 + 1669698140224 = 3852605^2 + 1292168^2 .
It is a cyclic number.
It is not a de Polignac number, because 16512263426249 - 216 = 16512263360713 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16512263426249.
It is not a weakly prime, because it can be changed into another prime (16512263426209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8256131713124 + 8256131713125.
It is an arithmetic number, because the mean of its divisors is an integer number (8256131713125).
Almost surely, 216512263426249 is an apocalyptic number.
It is an amenable number.
16512263426249 is a deficient number, since it is larger than the sum of its proper divisors (1).
16512263426249 is an equidigital number, since it uses as much as digits as its factorization.
16512263426249 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7464960, while the sum is 53.
The spelling of 16512263426249 in words is "sixteen trillion, five hundred twelve billion, two hundred sixty-three million, four hundred twenty-six thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •