Base | Representation |
---|---|
bin | 1011111010100001011011… |
… | …0100100110101011001001 |
3 | 1201101100110211111122001021 |
4 | 2332220112310212223021 |
5 | 3204112331441011244 |
6 | 43510023325552441 |
7 | 2521306014311242 |
oct | 276502664465311 |
9 | 51340424448037 |
10 | 13100033141449 |
11 | 41a0769211521 |
12 | 1576a5a715721 |
13 | 7404352cc987 |
14 | 33408b631cc9 |
15 | 17ab6676b284 |
hex | bea16d26ac9 |
13100033141449 has 2 divisors, whose sum is σ = 13100033141450. Its totient is φ = 13100033141448.
The previous prime is 13100033141423. The next prime is 13100033141479. The reversal of 13100033141449 is 94414133000131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8890129383424 + 4209903758025 = 2981632^2 + 2051805^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13100033141449 is a prime.
It is a super-2 number, since 2×131000331414492 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13100033141479) 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, 6550016570724 + 6550016570725.
It is an arithmetic number, because the mean of its divisors is an integer number (6550016570725).
Almost surely, 213100033141449 is an apocalyptic number.
It is an amenable number.
13100033141449 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100033141449 is an equidigital number, since it uses as much as digits as its factorization.
13100033141449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 13100033141449 in words is "thirteen trillion, one hundred billion, thirty-three million, one hundred forty-one thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •