Base | Representation |
---|---|
bin | 1011011001111100… |
… | …1111000110101001 |
3 | 21220101000111202212 |
4 | 2312133033012221 |
5 | 22232240013031 |
6 | 1223445334505 |
7 | 135604344632 |
oct | 26637170651 |
9 | 7811014685 |
10 | 3061641641 |
11 | 1331242753 |
12 | 715407435 |
13 | 39a3b7796 |
14 | 210890889 |
15 | 12dbbd12b |
hex | b67cf1a9 |
3061641641 has 4 divisors (see below), whose sum is σ = 3061814784. Its totient is φ = 3061468500.
The previous prime is 3061641631. The next prime is 3061641647. The reversal of 3061641641 is 1461461603.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3061641641 - 26 = 3061641577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3061641598 and 3061641607.
It is not an unprimeable number, because it can be changed into a prime (3061641647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56585 + ... + 96566.
It is an arithmetic number, because the mean of its divisors is an integer number (765453696).
Almost surely, 23061641641 is an apocalyptic number.
It is an amenable number.
3061641641 is a deficient number, since it is larger than the sum of its proper divisors (173143).
3061641641 is a wasteful number, since it uses less digits than its factorization.
3061641641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173142.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 3061641641 is about 55332.1031680525. The cubic root of 3061641641 is about 1452.0607466041.
The spelling of 3061641641 in words is "three billion, sixty-one million, six hundred forty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •