Base | Representation |
---|---|
bin | 1011011100000010… |
… | …01100101011010111 |
3 | 120211221221200211211 |
4 | 11232001030223113 |
5 | 100034014301002 |
6 | 2453202042251 |
7 | 305113504324 |
oct | 55601145327 |
9 | 16757850754 |
10 | 6140775127 |
11 | 2671342273 |
12 | 1234649387 |
13 | 76b2b7b66 |
14 | 4237b5b4b |
15 | 25e193dd7 |
hex | 16e04cad7 |
6140775127 has 2 divisors, whose sum is σ = 6140775128. Its totient is φ = 6140775126.
The previous prime is 6140775107. The next prime is 6140775131. The reversal of 6140775127 is 7215770416.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 6140775127 - 27 = 6140774999 is a prime.
It is a super-2 number, since 2×61407751272 = 75418238320763732258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6140775127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6140775107) 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, 3070387563 + 3070387564.
It is an arithmetic number, because the mean of its divisors is an integer number (3070387564).
Almost surely, 26140775127 is an apocalyptic number.
6140775127 is a deficient number, since it is larger than the sum of its proper divisors (1).
6140775127 is an equidigital number, since it uses as much as digits as its factorization.
6140775127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82320, while the sum is 40.
The square root of 6140775127 is about 78363.0979926138. The cubic root of 6140775127 is about 1831.2222842556. Note that the first 4 decimals are identical.
The spelling of 6140775127 in words is "six billion, one hundred forty million, seven hundred seventy-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •