Base | Representation |
---|---|
bin | 1011111100010001000100… |
… | …1111001001000100001101 |
3 | 1201111012211120100110020001 |
4 | 2333010101033021010031 |
5 | 3210110222034041322 |
6 | 43531501325524301 |
7 | 2523416513203561 |
oct | 277042117110415 |
9 | 51435746313201 |
10 | 13130004205837 |
11 | 4202449091822 |
12 | 1580823a13691 |
13 | 7432006a33bc |
14 | 3356d1ca76a1 |
15 | 17b81ca7b827 |
hex | bf1113c910d |
13130004205837 has 2 divisors, whose sum is σ = 13130004205838. Its totient is φ = 13130004205836.
The previous prime is 13130004205763. The next prime is 13130004205847. The reversal of 13130004205837 is 73850240003131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9147848260681 + 3982155945156 = 3024541^2 + 1995534^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13130004205837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13130004205796 and 13130004205805.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130004205847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565002102918 + 6565002102919.
It is an arithmetic number, because the mean of its divisors is an integer number (6565002102919).
Almost surely, 213130004205837 is an apocalyptic number.
It is an amenable number.
13130004205837 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130004205837 is an equidigital number, since it uses as much as digits as its factorization.
13130004205837 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 13130004205837 its reverse (73850240003131), we get a palindrome (86980244208968).
The spelling of 13130004205837 in words is "thirteen trillion, one hundred thirty billion, four million, two hundred five thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •