Base | Representation |
---|---|
bin | 1011111100000000… |
… | …10110000001010001 |
3 | 121112122122020221222 |
4 | 11332000112001101 |
5 | 101111200033310 |
6 | 2535542454425 |
7 | 314551326302 |
oct | 57600260121 |
9 | 17478566858 |
10 | 6408986705 |
11 | 2799784630 |
12 | 12aa434415 |
13 | 7b1a35934 |
14 | 44b2727a9 |
15 | 2779c4055 |
hex | 17e016051 |
6408986705 has 32 divisors (see below), whose sum is σ = 8483045760. Its totient is φ = 4609658880.
The previous prime is 6408986671. The next prime is 6408986707. The reversal of 6408986705 is 5076898046.
It is not a de Polignac number, because 6408986705 - 218 = 6408724561 is a prime.
It is a super-2 number, since 2×64089867052 = 82150221169733514050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (6408986707) 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 31 ways as a sum of consecutive naturals, for example, 1898399 + ... + 1901771.
It is an arithmetic number, because the mean of its divisors is an integer number (265095180).
Almost surely, 26408986705 is an apocalyptic number.
It is an amenable number.
6408986705 is a deficient number, since it is larger than the sum of its proper divisors (2074059055).
6408986705 is a wasteful number, since it uses less digits than its factorization.
6408986705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3761.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The square root of 6408986705 is about 80056.1472030724. The cubic root of 6408986705 is about 1857.5041392973.
The spelling of 6408986705 in words is "six billion, four hundred eight million, nine hundred eighty-six thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •