Base | Representation |
---|---|
bin | 1111000011100101… |
… | …0110000011000000 |
3 | 101102122220202000121 |
4 | 3300321112003000 |
5 | 31234120024402 |
6 | 1505012430024 |
7 | 202103505310 |
oct | 36071260300 |
9 | 11378822017 |
10 | 4041564352 |
11 | 17943a3131 |
12 | 949618314 |
13 | 4c54152c7 |
14 | 2a4a93440 |
15 | 189c35837 |
hex | f0e560c0 |
4041564352 has 112 divisors (see below), whose sum is σ = 9625340160. Its totient is φ = 1647055872.
The previous prime is 4041564341. The next prime is 4041564421. The reversal of 4041564352 is 2534651404.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×40415643522 = 32668484822714359808, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 868143 + ... + 872785.
Almost surely, 24041564352 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 4041564352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4812670080).
4041564352 is an abundant number, since it is smaller than the sum of its proper divisors (5583775808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4041564352 is a wasteful number, since it uses less digits than its factorization.
4041564352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4758 (or 4748 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 34.
The square root of 4041564352 is about 63573.2990492078. The cubic root of 4041564352 is about 1592.8803914742.
The spelling of 4041564352 in words is "four billion, forty-one million, five hundred sixty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •