Base | Representation |
---|---|
bin | 1011111100000101001110… |
… | …0100101100101011110001 |
3 | 1201110220121210211002012212 |
4 | 2333001103210230223301 |
5 | 3210032212434420323 |
6 | 43530213500101505 |
7 | 2523244614400145 |
oct | 277012344545361 |
9 | 51426553732185 |
10 | 13126822185713 |
11 | 42010659a9a25 |
12 | 1580096234895 |
13 | 742b1438b662 |
14 | 3354ad43d225 |
15 | 17b6d3530b78 |
hex | bf05392caf1 |
13126822185713 has 2 divisors, whose sum is σ = 13126822185714. Its totient is φ = 13126822185712.
The previous prime is 13126822185641. The next prime is 13126822185767. The reversal of 13126822185713 is 31758122862131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6839025213409 + 6287796972304 = 2615153^2 + 2507548^2 .
It is a cyclic number.
It is not a de Polignac number, because 13126822185713 - 212 = 13126822181617 is a prime.
It is a super-2 number, since 2×131268221857132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13126822185013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6563411092856 + 6563411092857.
It is an arithmetic number, because the mean of its divisors is an integer number (6563411092857).
Almost surely, 213126822185713 is an apocalyptic number.
It is an amenable number.
13126822185713 is a deficient number, since it is larger than the sum of its proper divisors (1).
13126822185713 is an equidigital number, since it uses as much as digits as its factorization.
13126822185713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 967680, while the sum is 50.
The spelling of 13126822185713 in words is "thirteen trillion, one hundred twenty-six billion, eight hundred twenty-two million, one hundred eighty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •