Base | Representation |
---|---|
bin | 101111110010100011100… |
… | …0111011100100101111001 |
3 | 212020220200000120020002221 |
4 | 1133211013013130211321 |
5 | 1330103132210130131 |
6 | 21545215532524041 |
7 | 1245352033634152 |
oct | 137450707344571 |
9 | 25226600506087 |
10 | 6568198130041 |
11 | 2102614680399 |
12 | 8a0b64320621 |
13 | 3884bc52bc72 |
14 | 189c8c5c6929 |
15 | b5cc1e04411 |
hex | 5f9471dc979 |
6568198130041 has 4 divisors (see below), whose sum is σ = 6675873509284. Its totient is φ = 6460522750800.
The previous prime is 6568198130009. The next prime is 6568198130047. The reversal of 6568198130041 is 1400318918656.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 482128866025 + 6086069264016 = 694355^2 + 2466996^2 .
It is a cyclic number.
It is not a de Polignac number, because 6568198130041 - 25 = 6568198130009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6568198130047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53837689530 + ... + 53837689651.
It is an arithmetic number, because the mean of its divisors is an integer number (1668968377321).
Almost surely, 26568198130041 is an apocalyptic number.
6568198130041 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
It is an amenable number.
6568198130041 is a deficient number, since it is larger than the sum of its proper divisors (107675379243).
6568198130041 is a wasteful number, since it uses less digits than its factorization.
6568198130041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107675379242.
The product of its (nonzero) digits is 1244160, while the sum is 52.
The spelling of 6568198130041 in words is "six trillion, five hundred sixty-eight billion, one hundred ninety-eight million, one hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •