Base | Representation |
---|---|
bin | 1100010100000001… |
… | …11000110111101000 |
3 | 122001200201221221012 |
4 | 12022000320313220 |
5 | 102014234043130 |
6 | 3011541003052 |
7 | 322545643406 |
oct | 61200706750 |
9 | 18050657835 |
10 | 6610456040 |
11 | 2892480511 |
12 | 13459b3488 |
13 | 8146b5966 |
14 | 469d18476 |
15 | 28a51d995 |
hex | 18a038de8 |
6610456040 has 64 divisors (see below), whose sum is σ = 15401826000. Its totient is φ = 2550446080.
The previous prime is 6610456037. The next prime is 6610456049. The reversal of 6610456040 is 406540166.
It can be written as a sum of positive squares in 8 ways, for example, as 5115396484 + 1495059556 = 71522^2 + 38666^2 .
It is a junction number, because it is equal to n+sod(n) for n = 6610455988 and 6610456006.
It is not an unprimeable number, because it can be changed into a prime (6610456049) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1493030 + ... + 1497450.
Almost surely, 26610456040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6610456040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7700913000).
6610456040 is an abundant number, since it is smaller than the sum of its proper divisors (8791369960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6610456040 is a wasteful number, since it uses less digits than its factorization.
6610456040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5750 (or 5746 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 6610456040 is about 81304.7110566171. The cubic root of 6610456040 is about 1876.7674985899.
The spelling of 6610456040 in words is "six billion, six hundred ten million, four hundred fifty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •