Base | Representation |
---|---|
bin | 1011110001000001111000… |
… | …0101011001011001000111 |
3 | 1200210202112000200222011122 |
4 | 2330100132011121121013 |
5 | 3143424331213224014 |
6 | 43303052343224155 |
7 | 2503443405356612 |
oct | 274203605313107 |
9 | 50722460628148 |
10 | 12936946226759 |
11 | 41385899746a5 |
12 | 154b32514805b |
13 | 72ac4466a019 |
14 | 32a219b6d179 |
15 | 1767bdcbc58e |
hex | bc41e159647 |
12936946226759 has 2 divisors, whose sum is σ = 12936946226760. Its totient is φ = 12936946226758.
The previous prime is 12936946226629. The next prime is 12936946226777. The reversal of 12936946226759 is 95762264963921.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12936946226759 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12936946226692 and 12936946226701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12936946246759) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6468473113379 + 6468473113380.
It is an arithmetic number, because the mean of its divisors is an integer number (6468473113380).
Almost surely, 212936946226759 is an apocalyptic number.
12936946226759 is a deficient number, since it is larger than the sum of its proper divisors (1).
12936946226759 is an equidigital number, since it uses as much as digits as its factorization.
12936946226759 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 529079040, while the sum is 71.
The spelling of 12936946226759 in words is "twelve trillion, nine hundred thirty-six billion, nine hundred forty-six million, two hundred twenty-six thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •