Base | Representation |
---|---|
bin | 1100000101000010… |
… | …10010010110101010 |
3 | 121201221011111000120 |
4 | 12002201102112222 |
5 | 101240042400211 |
6 | 2551250144110 |
7 | 316461210114 |
oct | 60241222652 |
9 | 17657144016 |
10 | 6484731306 |
11 | 2828509679 |
12 | 130b882036 |
13 | 7c4636121 |
14 | 45734c3b4 |
15 | 27e486d06 |
hex | 1828525aa |
6484731306 has 8 divisors (see below), whose sum is σ = 12969462624. Its totient is φ = 2161577100.
The previous prime is 6484731301. The next prime is 6484731349. The reversal of 6484731306 is 6031374846.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
6484731306 is an admirable number.
It is a super-2 number, since 2×64847313062 = 84103480222032931272, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6484731301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 540394270 + ... + 540394281.
It is an arithmetic number, because the mean of its divisors is an integer number (1621182828).
Almost surely, 26484731306 is an apocalyptic number.
6484731306 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6484731306 is a wasteful number, since it uses less digits than its factorization.
6484731306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080788556.
The product of its (nonzero) digits is 290304, while the sum is 42.
The square root of 6484731306 is about 80527.8293883549. The cubic root of 6484731306 is about 1864.7931360185.
The spelling of 6484731306 in words is "six billion, four hundred eighty-four million, seven hundred thirty-one thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •