Base | Representation |
---|---|
bin | 1111010010101101… |
… | …1111001011110100 |
3 | 101121002100200002210 |
4 | 3310223133023310 |
5 | 31401342300003 |
6 | 1515201133420 |
7 | 203504161323 |
oct | 36453371364 |
9 | 11532320083 |
10 | 4105040628 |
11 | 1817208867 |
12 | 96692a270 |
13 | 50560b630 |
14 | 2ad2980ba |
15 | 1905c3503 |
hex | f4adf2f4 |
4105040628 has 192 divisors, whose sum is σ = 10971797760. Its totient is φ = 1186099200.
The previous prime is 4105040617. The next prime is 4105040629. The reversal of 4105040628 is 8260405014.
It is a junction number, because it is equal to n+sod(n) for n = 4105040595 and 4105040604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4105040629) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31336123 + ... + 31336253.
It is an arithmetic number, because the mean of its divisors is an integer number (57144780).
Almost surely, 24105040628 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 4105040628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5485898880).
4105040628 is an abundant number, since it is smaller than the sum of its proper divisors (6866757132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4105040628 is a wasteful number, since it uses less digits than its factorization.
4105040628 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338 (or 336 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 4105040628 is about 64070.5909758916. The cubic root of 4105040628 is about 1601.1763000910.
The spelling of 4105040628 in words is "four billion, one hundred five million, forty thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •