Base | Representation |
---|---|
bin | 1100000100100011… |
… | …01011111110010101 |
3 | 121201122110201110121 |
4 | 12002101223332111 |
5 | 101233021020231 |
6 | 2551022351541 |
7 | 316411355554 |
oct | 60221537625 |
9 | 17648421417 |
10 | 6480641941 |
11 | 2826176234 |
12 | 130a42b5b1 |
13 | 7c3833997 |
14 | 4569a5d9b |
15 | 27de2a311 |
hex | 18246bf95 |
6480641941 has 4 divisors (see below), whose sum is σ = 6569417932. Its totient is φ = 6391865952.
The previous prime is 6480641911. The next prime is 6480641963. The reversal of 6480641941 is 1491460846.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2868030916 + 3612611025 = 53554^2 + 60105^2 .
It is a cyclic number.
It is not a de Polignac number, because 6480641941 - 27 = 6480641813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6480641911) 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 in 3 ways as a sum of consecutive naturals, for example, 44387886 + ... + 44388031.
It is an arithmetic number, because the mean of its divisors is an integer number (1642354483).
Almost surely, 26480641941 is an apocalyptic number.
It is an amenable number.
6480641941 is a deficient number, since it is larger than the sum of its proper divisors (88775991).
6480641941 is an equidigital number, since it uses as much as digits as its factorization.
6480641941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88775990.
The product of its (nonzero) digits is 165888, while the sum is 43.
The square root of 6480641941 is about 80502.4343793404. The cubic root of 6480641941 is about 1864.4010651180.
The spelling of 6480641941 in words is "six billion, four hundred eighty million, six hundred forty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •