Base | Representation |
---|---|
bin | 1100000101100011… |
… | …10010101010111101 |
3 | 121202020022022002210 |
4 | 12002301302222331 |
5 | 101242144323411 |
6 | 2551523011033 |
7 | 316543040250 |
oct | 60261625275 |
9 | 17666268083 |
10 | 6489057981 |
11 | 282a9a433a |
12 | 1311209a79 |
13 | 7c54bc5a3 |
14 | 457b57097 |
15 | 27ea3dca6 |
hex | 182c72abd |
6489057981 has 64 divisors (see below), whose sum is σ = 10835804160. Its totient is φ = 3368494080.
The previous prime is 6489057979. The next prime is 6489057983. The reversal of 6489057981 is 1897509846.
It is an interprime number because it is at equal distance from previous prime (6489057979) and next prime (6489057983).
It is not a de Polignac number, because 6489057981 - 21 = 6489057979 is a prime.
It is a super-2 number, since 2×64890579812 = 84215746961559592722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6489057983) 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 63 ways as a sum of consecutive naturals, for example, 7846090 + ... + 7846916.
It is an arithmetic number, because the mean of its divisors is an integer number (169309440).
Almost surely, 26489057981 is an apocalyptic number.
It is an amenable number.
6489057981 is a deficient number, since it is larger than the sum of its proper divisors (4346746179).
6489057981 is a wasteful number, since it uses less digits than its factorization.
6489057981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594.
The product of its (nonzero) digits is 4354560, while the sum is 57.
The square root of 6489057981 is about 80554.6893793279. The cubic root of 6489057981 is about 1865.2077797767.
The spelling of 6489057981 in words is "six billion, four hundred eighty-nine million, fifty-seven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •