Base | Representation |
---|---|
bin | 1100001010010000101111… |
… | …1000110001100000000001 |
3 | 1202100012102102211121100001 |
4 | 3002210023320301200001 |
5 | 3223030121222442031 |
6 | 44234143021200001 |
7 | 2546660533065031 |
oct | 302441370614001 |
9 | 52305372747301 |
10 | 13370432624641 |
11 | 4295406717394 |
12 | 15bb342a00001 |
13 | 75ca98756781 |
14 | 3431bd3d78c1 |
15 | 182be0411861 |
hex | c290be31801 |
13370432624641 has 2 divisors, whose sum is σ = 13370432624642. Its totient is φ = 13370432624640.
The previous prime is 13370432624623. The next prime is 13370432624663. The reversal of 13370432624641 is 14642623407331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11107529177616 + 2262903447025 = 3332796^2 + 1504295^2 .
It is a cyclic number.
It is not a de Polignac number, because 13370432624641 - 219 = 13370432100353 is a prime.
It is a super-4 number, since 4×133704326246414 (a number of 54 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13370432624591 and 13370432624600.
It is not a weakly prime, because it can be changed into another prime (13370432624611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6685216312320 + 6685216312321.
It is an arithmetic number, because the mean of its divisors is an integer number (6685216312321).
Almost surely, 213370432624641 is an apocalyptic number.
It is an amenable number.
13370432624641 is a deficient number, since it is larger than the sum of its proper divisors (1).
13370432624641 is an equidigital number, since it uses as much as digits as its factorization.
13370432624641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1741824, while the sum is 46.
The spelling of 13370432624641 in words is "thirteen trillion, three hundred seventy billion, four hundred thirty-two million, six hundred twenty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •