Base | Representation |
---|---|
bin | 1100100011000110… |
… | …11000111001100001 |
3 | 122101111202001012001 |
4 | 12101203120321201 |
5 | 102244124100031 |
6 | 3032300004001 |
7 | 325643023234 |
oct | 62143307141 |
9 | 18344661161 |
10 | 6736940641 |
11 | 2947911242 |
12 | 1380230601 |
13 | 834970312 |
14 | 47ca4141b |
15 | 2966a5861 |
hex | 1918d8e61 |
6736940641 has 8 divisors (see below), whose sum is σ = 6768959400. Its totient is φ = 6704974080.
The previous prime is 6736940633. The next prime is 6736940653. The reversal of 6736940641 is 1460496376.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 208947025 + 6527993616 = 14455^2 + 80796^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6736940641 - 23 = 6736940633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6736940591 and 6736940600.
It is not an unprimeable number, because it can be changed into a prime (6736940621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 259011 + ... + 283831.
It is an arithmetic number, because the mean of its divisors is an integer number (846119925).
Almost surely, 26736940641 is an apocalyptic number.
It is an amenable number.
6736940641 is a deficient number, since it is larger than the sum of its proper divisors (32018759).
6736940641 is a wasteful number, since it uses less digits than its factorization.
6736940641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26099.
The product of its (nonzero) digits is 653184, while the sum is 46.
The square root of 6736940641 is about 82078.8684193441. The cubic root of 6736940641 is about 1888.6619908525.
The spelling of 6736940641 in words is "six billion, seven hundred thirty-six million, nine hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •