Base | Representation |
---|---|
bin | 1011011100000001… |
… | …01000011101011101 |
3 | 120211221200011100112 |
4 | 11232000220131131 |
5 | 100034000024111 |
6 | 2453154535405 |
7 | 305112315662 |
oct | 55600503535 |
9 | 16757604315 |
10 | 6140626781 |
11 | 2671250873 |
12 | 1234597565 |
13 | 76b265493 |
14 | 423777a69 |
15 | 25e164e8b |
hex | 16e02875d |
6140626781 has 2 divisors, whose sum is σ = 6140626782. Its totient is φ = 6140626780.
The previous prime is 6140626757. The next prime is 6140626783. The reversal of 6140626781 is 1876260416.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5476740025 + 663886756 = 74005^2 + 25766^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6140626781 is a prime.
It is a super-2 number, since 2×61406267812 = 75414594527068843922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 6140626783, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6140626783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3070313390 + 3070313391.
It is an arithmetic number, because the mean of its divisors is an integer number (3070313391).
Almost surely, 26140626781 is an apocalyptic number.
It is an amenable number.
6140626781 is a deficient number, since it is larger than the sum of its proper divisors (1).
6140626781 is an equidigital number, since it uses as much as digits as its factorization.
6140626781 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96768, while the sum is 41.
The square root of 6140626781 is about 78362.1514571926. The cubic root of 6140626781 is about 1831.2075381970.
The spelling of 6140626781 in words is "six billion, one hundred forty million, six hundred twenty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •