Base | Representation |
---|---|
bin | 1011011011001111… |
… | …00101101001001001 |
3 | 120211111022121200012 |
4 | 11231213211221021 |
5 | 100030304433031 |
6 | 2452402121305 |
7 | 305002443431 |
oct | 55547455111 |
9 | 16744277605 |
10 | 6134061641 |
11 | 2668577334 |
12 | 1232350235 |
13 | 769aa7196 |
14 | 4229492c1 |
15 | 25d7b9b2b |
hex | 16d9e5a49 |
6134061641 has 2 divisors, whose sum is σ = 6134061642. Its totient is φ = 6134061640.
The previous prime is 6134061611. The next prime is 6134061677. The reversal of 6134061641 is 1461604316.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5631001600 + 503060041 = 75040^2 + 22429^2 .
It is a cyclic number.
It is not a de Polignac number, because 6134061641 - 226 = 6066952777 is a prime.
It is a super-2 number, since 2×61340616412 = 75253424431175225762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6134061598 and 6134061607.
It is not a weakly prime, because it can be changed into another prime (6134061611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3067030820 + 3067030821.
It is an arithmetic number, because the mean of its divisors is an integer number (3067030821).
Almost surely, 26134061641 is an apocalyptic number.
It is an amenable number.
6134061641 is a deficient number, since it is larger than the sum of its proper divisors (1).
6134061641 is an equidigital number, since it uses as much as digits as its factorization.
6134061641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 6134061641 is about 78320.2505167086. The cubic root of 6134061641 is about 1830.5547046862.
Adding to 6134061641 its reverse (1461604316), we get a palindrome (7595665957).
The spelling of 6134061641 in words is "six billion, one hundred thirty-four million, sixty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •