Base | Representation |
---|---|
bin | 1011111110000010100111… |
… | …1001001110110101001111 |
3 | 1201121010111122221112110221 |
4 | 2333200221321032311033 |
5 | 3211110132030220014 |
6 | 43553501533012211 |
7 | 2525546012625514 |
oct | 277405171166517 |
9 | 51533448845427 |
10 | 13160482663759 |
11 | 4214369409322 |
12 | 158670b024067 |
13 | 746049c1a2a2 |
14 | 336d83a9b30b |
15 | 17c5036b5b24 |
hex | bf829e4ed4f |
13160482663759 has 2 divisors, whose sum is σ = 13160482663760. Its totient is φ = 13160482663758.
The previous prime is 13160482663753. The next prime is 13160482663787. The reversal of 13160482663759 is 95736628406131.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (95736628406131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13160482663759 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13160482663697 and 13160482663706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13160482663753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6580241331879 + 6580241331880.
It is an arithmetic number, because the mean of its divisors is an integer number (6580241331880).
It is a 1-persistent number, because it is pandigital, but 2⋅13160482663759 = 26320965327518 is not.
Almost surely, 213160482663759 is an apocalyptic number.
13160482663759 is a deficient number, since it is larger than the sum of its proper divisors (1).
13160482663759 is an equidigital number, since it uses as much as digits as its factorization.
13160482663759 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 39191040, while the sum is 61.
The spelling of 13160482663759 in words is "thirteen trillion, one hundred sixty billion, four hundred eighty-two million, six hundred sixty-three thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •