Base | Representation |
---|---|
bin | 1011111011110001… |
… | …01011011110000000 |
3 | 121112111212011201120 |
4 | 11331320223132000 |
5 | 101110141234113 |
6 | 2535431432240 |
7 | 314525260266 |
oct | 57570533600 |
9 | 17474764646 |
10 | 6406977408 |
11 | 2798631a57 |
12 | 12a9825680 |
13 | 7b14b11c0 |
14 | 44acac436 |
15 | 277728a23 |
hex | 17de2b780 |
6406977408 has 192 divisors, whose sum is σ = 19473550320. Its totient is φ = 1854996480.
The previous prime is 6406977389. The next prime is 6406977413. The reversal of 6406977408 is 8047796046.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1440468 + ... + 1444908.
Almost surely, 26406977408 is an apocalyptic number.
6406977408 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6406977408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9736775160).
6406977408 is an abundant number, since it is smaller than the sum of its proper divisors (13066572912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6406977408 is a wasteful number, since it uses less digits than its factorization.
6406977408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4505 (or 4476 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 51.
The square root of 6406977408 is about 80043.5969206782. The cubic root of 6406977408 is about 1857.3100021285.
The spelling of 6406977408 in words is "six billion, four hundred six million, nine hundred seventy-seven thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •