Base | Representation |
---|---|
bin | 1100000101110000… |
… | …00101001111000000 |
3 | 121202100102001222010 |
4 | 12002320011033000 |
5 | 101243110110010 |
6 | 2552022212520 |
7 | 316563045450 |
oct | 60270051700 |
9 | 17670361863 |
10 | 6490706880 |
11 | 2830920169 |
12 | 1311884140 |
13 | 7c5948c78 |
14 | 458065d60 |
15 | 27ec67620 |
hex | 182e053c0 |
6490706880 has 224 divisors, whose sum is σ = 23642141184. Its totient is φ = 1477914624.
The previous prime is 6490706867. The next prime is 6490706917. The reversal of 6490706880 is 886070946.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1900054 + ... + 1903466.
Almost surely, 26490706880 is an apocalyptic number.
6490706880 is a gapful number since it is divisible by the number (60) 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 6490706880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11821070592).
6490706880 is an abundant number, since it is smaller than the sum of its proper divisors (17151434304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6490706880 is a wasteful number, since it uses less digits than its factorization.
6490706880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3723 (or 3713 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 48.
The square root of 6490706880 is about 80564.9233848081. The cubic root of 6490706880 is about 1865.3657523096.
The spelling of 6490706880 in words is "six billion, four hundred ninety million, seven hundred six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •