Base | Representation |
---|---|
bin | 1111010010011111… |
… | …0000111000111100 |
3 | 101121000112002012120 |
4 | 3310213300320330 |
5 | 31401120031242 |
6 | 1515124202540 |
7 | 203462654556 |
oct | 36447607074 |
9 | 11530462176 |
10 | 4104064572 |
11 | 1816701503 |
12 | 966539450 |
13 | 50535929a |
14 | 2ad0c24d6 |
15 | 19047e1ec |
hex | f49f0e3c |
4104064572 has 48 divisors (see below), whose sum is σ = 9941853600. Its totient is φ = 1316116480.
The previous prime is 4104064553. The next prime is 4104064583. The reversal of 4104064572 is 2754604014.
It is a super-2 number, since 2×41040645722 = 33686692022291086368, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76804 + ... + 118772.
It is an arithmetic number, because the mean of its divisors is an integer number (207121950).
Almost surely, 24104064572 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 4104064572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4970926800).
4104064572 is an abundant number, since it is smaller than the sum of its proper divisors (5837789028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4104064572 is a wasteful number, since it uses less digits than its factorization.
4104064572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42286 (or 42284 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
The square root of 4104064572 is about 64062.9734870307. The cubic root of 4104064572 is about 1601.0493860717.
Adding to 4104064572 its reverse (2754604014), we get a palindrome (6858668586).
The spelling of 4104064572 in words is "four billion, one hundred four million, sixty-four thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •