Base | Representation |
---|---|
bin | 1011111100010001111110… |
… | …0010010011011010001111 |
3 | 1201111020110021202211211012 |
4 | 2333010133202103122033 |
5 | 3210111214443004332 |
6 | 43531541215515435 |
7 | 2523425455306535 |
oct | 277043742233217 |
9 | 51436407684735 |
10 | 13130244109967 |
11 | 420256154a2a6 |
12 | 1580890228b7b |
13 | 74323b2bc6ca |
14 | 335715ab6155 |
15 | 17b833b693b2 |
hex | bf11f89368f |
13130244109967 has 2 divisors, whose sum is σ = 13130244109968. Its totient is φ = 13130244109966.
The previous prime is 13130244109921. The next prime is 13130244110017. The reversal of 13130244109967 is 76990144203131.
It is an a-pointer prime, because the next prime (13130244110017) can be obtained adding 13130244109967 to its sum of digits (50).
It is a weak prime.
It is an emirp because it is prime and its reverse (76990144203131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13130244109967 - 26 = 13130244109903 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130244108967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565122054983 + 6565122054984.
It is an arithmetic number, because the mean of its divisors is an integer number (6565122054984).
Almost surely, 213130244109967 is an apocalyptic number.
13130244109967 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130244109967 is an equidigital number, since it uses as much as digits as its factorization.
13130244109967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776, while the sum is 50.
The spelling of 13130244109967 in words is "thirteen trillion, one hundred thirty billion, two hundred forty-four million, one hundred nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •