Base | Representation |
---|---|
bin | 1011100010110001… |
… | …10100001101011101 |
3 | 120222220022100200001 |
4 | 11301120310031131 |
5 | 100143002014023 |
6 | 2502541334301 |
7 | 306401110144 |
oct | 56130641535 |
9 | 16886270601 |
10 | 6197298013 |
11 | 26a02387a5 |
12 | 124b567391 |
13 | 779c1825a |
14 | 42b0ca75b |
15 | 26410b6ad |
hex | 17163435d |
6197298013 has 2 divisors, whose sum is σ = 6197298014. Its totient is φ = 6197298012.
The previous prime is 6197297959. The next prime is 6197298047. The reversal of 6197298013 is 3108927916.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6171359364 + 25938649 = 78558^2 + 5093^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6197298013 is a prime.
It is a super-4 number, since 4×61972980134 (a number of 40 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6197298053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3098649006 + 3098649007.
It is an arithmetic number, because the mean of its divisors is an integer number (3098649007).
Almost surely, 26197298013 is an apocalyptic number.
It is an amenable number.
6197298013 is a deficient number, since it is larger than the sum of its proper divisors (1).
6197298013 is an equidigital number, since it uses as much as digits as its factorization.
6197298013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 46.
The square root of 6197298013 is about 78722.9192357601. The cubic root of 6197298013 is about 1836.8236405497.
The spelling of 6197298013 in words is "six billion, one hundred ninety-seven million, two hundred ninety-eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •