Base | Representation |
---|---|
bin | 1111000001010001110111… |
… | …1111111001000110011001 |
3 | 2011110210012112022201222022 |
4 | 3300110131333321012121 |
5 | 4131034002022310322 |
6 | 55042420542104225 |
7 | 3323100325313426 |
oct | 360243577710631 |
9 | 64423175281868 |
10 | 16514652541337 |
11 | 5297908907065 |
12 | 1a2879787b075 |
13 | 92a42c1a8892 |
14 | 41145615ad4d |
15 | 1d98b608c942 |
hex | f051dff9199 |
16514652541337 has 2 divisors, whose sum is σ = 16514652541338. Its totient is φ = 16514652541336.
The previous prime is 16514652541259. The next prime is 16514652541363. The reversal of 16514652541337 is 73314525641561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8602465536016 + 7912187005321 = 2932996^2 + 2812861^2 .
It is an emirp because it is prime and its reverse (73314525641561) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16514652541337 - 212 = 16514652537241 is a prime.
It is a super-2 number, since 2×165146525413372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16514652541237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8257326270668 + 8257326270669.
It is an arithmetic number, because the mean of its divisors is an integer number (8257326270669).
Almost surely, 216514652541337 is an apocalyptic number.
It is an amenable number.
16514652541337 is a deficient number, since it is larger than the sum of its proper divisors (1).
16514652541337 is an equidigital number, since it uses as much as digits as its factorization.
16514652541337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9072000, while the sum is 53.
The spelling of 16514652541337 in words is "sixteen trillion, five hundred fourteen billion, six hundred fifty-two million, five hundred forty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •