Base | Representation |
---|---|
bin | 1100001111011100011001… |
… | …1010111010100101101101 |
3 | 1202122201020000100012101022 |
4 | 3003313012122322211231 |
5 | 3231004434114422421 |
6 | 44343105150423525 |
7 | 2556262000642322 |
oct | 303670632724555 |
9 | 52581200305338 |
10 | 13459461482861 |
11 | 431a142135269 |
12 | 161464a501ba5 |
13 | 7682b6303c34 |
14 | 34762733ab49 |
15 | 1851a13ac7ab |
hex | c3dc66ba96d |
13459461482861 has 2 divisors, whose sum is σ = 13459461482862. Its totient is φ = 13459461482860.
The previous prime is 13459461482807. The next prime is 13459461482893. The reversal of 13459461482861 is 16828416495431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11097599665636 + 2361861817225 = 3331306^2 + 1536835^2 .
It is an emirp because it is prime and its reverse (16828416495431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13459461482861 - 218 = 13459461220717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13459461482794 and 13459461482803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13459461485861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6729730741430 + 6729730741431.
It is an arithmetic number, because the mean of its divisors is an integer number (6729730741431).
Almost surely, 213459461482861 is an apocalyptic number.
It is an amenable number.
13459461482861 is a deficient number, since it is larger than the sum of its proper divisors (1).
13459461482861 is an equidigital number, since it uses as much as digits as its factorization.
13459461482861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 39813120, while the sum is 62.
The spelling of 13459461482861 in words is "thirteen trillion, four hundred fifty-nine billion, four hundred sixty-one million, four hundred eighty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •