Base | Representation |
---|---|
bin | 1011011110010001100100… |
… | …1010001110100110110001 |
3 | 1122122221211222211121002111 |
4 | 2313210121022032212301 |
5 | 3123134442202410032 |
6 | 42455044304245321 |
7 | 2441246020551625 |
oct | 267443112164661 |
9 | 48587758747074 |
10 | 12614741060017 |
11 | 402397750aa28 |
12 | 14b89a3310841 |
13 | 7067463434c5 |
14 | 3187b1921185 |
15 | 16d211ea4c47 |
hex | b791928e9b1 |
12614741060017 has 2 divisors, whose sum is σ = 12614741060018. Its totient is φ = 12614741060016.
The previous prime is 12614741059969. The next prime is 12614741060041. The reversal of 12614741060017 is 71006014741621.
12614741060017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8321055621376 + 4293685438641 = 2884624^2 + 2072121^2 .
It is a cyclic number.
It is not a de Polignac number, because 12614741060017 - 211 = 12614741057969 is a prime.
It is a super-2 number, since 2×126147410600172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12614741060417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6307370530008 + 6307370530009.
It is an arithmetic number, because the mean of its divisors is an integer number (6307370530009).
Almost surely, 212614741060017 is an apocalyptic number.
It is an amenable number.
12614741060017 is a deficient number, since it is larger than the sum of its proper divisors (1).
12614741060017 is an equidigital number, since it uses as much as digits as its factorization.
12614741060017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56448, while the sum is 40.
The spelling of 12614741060017 in words is "twelve trillion, six hundred fourteen billion, seven hundred forty-one million, sixty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •