Base | Representation |
---|---|
bin | 110010101100101110111… |
… | …0011110010010011101001 |
3 | 220200010122122122210010201 |
4 | 1211121131303302103221 |
5 | 1403130441231414401 |
6 | 22453020542112201 |
7 | 1316264542433311 |
oct | 145313563622351 |
9 | 26603578583121 |
10 | 6968010810601 |
11 | 22471314a0935 |
12 | 94654487b661 |
13 | 3b71081029a9 |
14 | 1a1379948441 |
15 | c13c214ab01 |
hex | 6565dcf24e9 |
6968010810601 has 3 divisors (see below), whose sum is σ = 6968013450301. Its totient is φ = 6968008170902.
The previous prime is 6968010810599. The next prime is 6968010810613. The reversal of 6968010810601 is 1060180108696.
It is a happy number.
The square root of 6968010810601 is 2639699.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 6968010810601 - 21 = 6968010810599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6968010810001) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1319850 + ... + 3959548.
Almost surely, 26968010810601 is an apocalyptic number.
6968010810601 is the 2639699-th square number.
6968010810601 is the 1319850-th centered octagonal number.
It is an amenable number.
6968010810601 is a deficient number, since it is larger than the sum of its proper divisors (2639700).
6968010810601 is an frugal number, since it uses more digits than its factorization.
6968010810601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5279398 (or 2639699 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 46.
The spelling of 6968010810601 in words is "six trillion, nine hundred sixty-eight billion, ten million, eight hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •