Base | Representation |
---|---|
bin | 101111010000001011010… |
… | …1111100000011011011001 |
3 | 211222212002221212112001100 |
4 | 1132200112233200123121 |
5 | 1322400433224311042 |
6 | 21451250124542013 |
7 | 1240126411030266 |
oct | 136402657403331 |
9 | 24885087775040 |
10 | 6494372103897 |
11 | 208427a821247 |
12 | 88a7a00b1909 |
13 | 381555536c22 |
14 | 1864877c626d |
15 | b3e0098624c |
hex | 5e816be06d9 |
6494372103897 has 12 divisors (see below), whose sum is σ = 9380783329060. Its totient is φ = 4329570499488.
The previous prime is 6494372103883. The next prime is 6494372103911. The reversal of 6494372103897 is 7983012734946.
6494372103897 is a `hidden beast` number, since 6 + 4 + 9 + 4 + 37 + 210 + 389 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (6494372103883) and next prime (6494372103911).
It can be written as a sum of positive squares in 2 ways, for example, as 958967774361 + 5535404329536 = 979269^2 + 2352744^2 .
It is not a de Polignac number, because 6494372103897 - 26 = 6494372103833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6494372103847) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4660203 + ... + 5891199.
Almost surely, 26494372103897 is an apocalyptic number.
It is an amenable number.
6494372103897 is a deficient number, since it is larger than the sum of its proper divisors (2886411225163).
6494372103897 is a wasteful number, since it uses less digits than its factorization.
6494372103897 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1817192 (or 1817189 counting only the distinct ones).
The product of its (nonzero) digits is 54867456, while the sum is 63.
The spelling of 6494372103897 in words is "six trillion, four hundred ninety-four billion, three hundred seventy-two million, one hundred three thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •