Base | Representation |
---|---|
bin | 1111010011101111… |
… | …0110101010000000 |
3 | 101121101102122111010 |
4 | 3310323312222000 |
5 | 31403442043242 |
6 | 1515433120520 |
7 | 203555511030 |
oct | 36473665200 |
9 | 11541378433 |
10 | 4109331072 |
11 | 1819679290 |
12 | 968259140 |
13 | 506481462 |
14 | 2ada938c0 |
15 | 190b6e89c |
hex | f4ef6a80 |
4109331072 has 256 divisors, whose sum is σ = 13903073280. Its totient is φ = 1044295680.
The previous prime is 4109331053. The next prime is 4109331131. The reversal of 4109331072 is 2701339014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1388218 + ... + 1391174.
It is an arithmetic number, because the mean of its divisors is an integer number (54308880).
Almost surely, 24109331072 is an apocalyptic number.
4109331072 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4109331072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6951536640).
4109331072 is an abundant number, since it is smaller than the sum of its proper divisors (9793742208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4109331072 is a wasteful number, since it uses less digits than its factorization.
4109331072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3039 (or 3027 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 30.
The square root of 4109331072 is about 64104.0643953252. The cubic root of 4109331072 is about 1601.7339369021.
The spelling of 4109331072 in words is "four billion, one hundred nine million, three hundred thirty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •