Base | Representation |
---|---|
bin | 1011001100011101… |
… | …01111010111000010 |
3 | 120111212002002022210 |
4 | 11212032233113002 |
5 | 44302041413310 |
6 | 2432213242550 |
7 | 301636032543 |
oct | 54616572702 |
9 | 16455062283 |
10 | 6010107330 |
11 | 2604604657 |
12 | 11b8933456 |
13 | 74a1c7436 |
14 | 4102c04ca |
15 | 252982820 |
hex | 1663af5c2 |
6010107330 has 64 divisors (see below), whose sum is σ = 14904787968. Its totient is φ = 1549409280.
The previous prime is 6010107307. The next prime is 6010107343. The reversal of 6010107330 is 337010106.
It is a super-2 number, since 2×60101073302 = 72242780236239457800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6010107297 and 6010107306.
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, 1106782 + ... + 1112198.
It is an arithmetic number, because the mean of its divisors is an integer number (232887312).
Almost surely, 26010107330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6010107330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7452393984).
6010107330 is an abundant number, since it is smaller than the sum of its proper divisors (8894680638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6010107330 is a wasteful number, since it uses less digits than its factorization.
6010107330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6651.
The product of its (nonzero) digits is 378, while the sum is 21.
The square root of 6010107330 is about 77524.8820057148. The cubic root of 6010107330 is about 1818.1403669512.
Adding to 6010107330 its reverse (337010106), we get a palindrome (6347117436).
The spelling of 6010107330 in words is "six billion, ten million, one hundred seven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •