Base | Representation |
---|---|
bin | 1011100101100011… |
… | …11100000110101000 |
3 | 121001112021022212210 |
4 | 11302301330012220 |
5 | 100214442124120 |
6 | 2505134205120 |
7 | 310103514240 |
oct | 56261740650 |
9 | 17045238783 |
10 | 6220661160 |
11 | 270244588a |
12 | 12573537a0 |
13 | 781a083bc |
14 | 43024cb20 |
15 | 2661c3ce0 |
hex | 172c7c1a8 |
6220661160 has 128 divisors (see below), whose sum is σ = 21344440320. Its totient is φ = 1420768512.
The previous prime is 6220661147. The next prime is 6220661191. The reversal of 6220661160 is 611660226.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1667217 + ... + 1670943.
It is an arithmetic number, because the mean of its divisors is an integer number (166753440).
Almost surely, 26220661160 is an apocalyptic number.
6220661160 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 6220661160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10672220160).
6220661160 is an abundant number, since it is smaller than the sum of its proper divisors (15123779160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6220661160 is a wasteful number, since it uses less digits than its factorization.
6220661160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5735 (or 5731 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The square root of 6220661160 is about 78871.1681161120. The cubic root of 6220661160 is about 1839.1289552351.
The spelling of 6220661160 in words is "six billion, two hundred twenty million, six hundred sixty-one thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •