Base | Representation |
---|---|
bin | 1111010000101011… |
… | …1111011010100000 |
3 | 101120111022212120220 |
4 | 3310022333122200 |
5 | 31342202200023 |
6 | 1514254403040 |
7 | 203341601334 |
oct | 36412773240 |
9 | 11514285526 |
10 | 4096521888 |
11 | 181241a588 |
12 | 963b00480 |
13 | 503918064 |
14 | 2ac0bb7c4 |
15 | 18e98e3e3 |
hex | f42bf6a0 |
4096521888 has 48 divisors (see below), whose sum is σ = 11015657856. Its totient is φ = 1332200960.
The previous prime is 4096521851. The next prime is 4096521899. The reversal of 4096521888 is 8881256904.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 4096521888.
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 7 ways as a sum of consecutive naturals, for example, 516456 + ... + 524327.
It is an arithmetic number, because the mean of its divisors is an integer number (229492872).
Almost surely, 24096521888 is an apocalyptic number.
4096521888 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4096521888 is an abundant number, since it is smaller than the sum of its proper divisors (6919135968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4096521888 is a wasteful number, since it uses less digits than its factorization.
4096521888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1040837 (or 1040829 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 51.
The square root of 4096521888 is about 64004.0771201335. The cubic root of 4096521888 is about 1600.0679512808.
The spelling of 4096521888 in words is "four billion, ninety-six million, five hundred twenty-one thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •