Base | Representation |
---|---|
bin | 1111010010101101… |
… | …0110111000011100 |
3 | 101121002021221110020 |
4 | 3310223112320130 |
5 | 31401340202440 |
6 | 1515200312140 |
7 | 203503660221 |
oct | 36453267034 |
9 | 11532257406 |
10 | 4105006620 |
11 | 1817195260 |
12 | 966912650 |
13 | 5055c9000 |
14 | 2ad289948 |
15 | 1905b83d0 |
hex | f4ad6e1c |
4105006620 has 384 divisors, whose sum is σ = 14394240000. Its totient is φ = 864414720.
The previous prime is 4105006583. The next prime is 4105006621. The reversal of 4105006620 is 266005014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4105006621) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 27550306 + ... + 27550454.
It is an arithmetic number, because the mean of its divisors is an integer number (37485000).
Almost surely, 24105006620 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 4105006620, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7197120000).
4105006620 is an abundant number, since it is smaller than the sum of its proper divisors (10289233380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4105006620 is a wasteful number, since it uses less digits than its factorization.
4105006620 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230 (or 202 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 4105006620 is about 64070.3255805681. The cubic root of 4105006620 is about 1601.1718784577.
It can be divided in two parts, 410 and 5006620, that added together give a triangular number (5007030 = T3164).
The spelling of 4105006620 in words is "four billion, one hundred five million, six thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •