Base | Representation |
---|---|
bin | 1011111011111011111100… |
… | …1101101101111010011101 |
3 | 1201110200012100020010102201 |
4 | 2332332333031231322131 |
5 | 3210012113240232334 |
6 | 43525122503051501 |
7 | 2523126131656105 |
oct | 276767715557235 |
9 | 51420170203381 |
10 | 13124333133469 |
11 | 41aaaa89a3158 |
12 | 157b700740b91 |
13 | 7428087c328c |
14 | 335314a3c205 |
15 | 17b5d9c68c14 |
hex | befbf36de9d |
13124333133469 has 2 divisors, whose sum is σ = 13124333133470. Its totient is φ = 13124333133468.
The previous prime is 13124333133467. The next prime is 13124333133487. The reversal of 13124333133469 is 96433133342131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9414618305625 + 3709714827844 = 3068325^2 + 1926062^2 .
It is a cyclic number.
It is not a de Polignac number, because 13124333133469 - 21 = 13124333133467 is a prime.
It is a super-2 number, since 2×131243331334692 (a number of 27 digits) contains 22 as substring.
Together with 13124333133467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13124333133467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6562166566734 + 6562166566735.
It is an arithmetic number, because the mean of its divisors is an integer number (6562166566735).
Almost surely, 213124333133469 is an apocalyptic number.
It is an amenable number.
13124333133469 is a deficient number, since it is larger than the sum of its proper divisors (1).
13124333133469 is an equidigital number, since it uses as much as digits as its factorization.
13124333133469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1259712, while the sum is 46.
The spelling of 13124333133469 in words is "thirteen trillion, one hundred twenty-four billion, three hundred thirty-three million, one hundred thirty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •