Base | Representation |
---|---|
bin | 1000011000000100… |
… | …00101000000010000 |
3 | 102121101121001222110 |
4 | 10030002011000100 |
5 | 33202142314142 |
6 | 2022114505320 |
7 | 216302332554 |
oct | 41402050020 |
9 | 12541531873 |
10 | 4496838672 |
11 | 19a83914a7 |
12 | a55b95240 |
13 | 56883a8b1 |
14 | 309325864 |
15 | 1b4bb699c |
hex | 10c085010 |
4496838672 has 80 divisors (see below), whose sum is σ = 12284213760. Its totient is φ = 1415193600.
The previous prime is 4496838659. The next prime is 4496838677. The reversal of 4496838672 is 2768386944.
It is not an unprimeable number, because it can be changed into a prime (4496838677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24154 + ... + 97862.
It is an arithmetic number, because the mean of its divisors is an integer number (153552672).
Almost surely, 24496838672 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 4496838672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6142106880).
4496838672 is an abundant number, since it is smaller than the sum of its proper divisors (7787375088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4496838672 is a wasteful number, since it uses less digits than its factorization.
4496838672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73792 (or 73786 counting only the distinct ones).
The product of its digits is 13934592, while the sum is 57.
The square root of 4496838672 is about 67058.4720374689. The cubic root of 4496838672 is about 1650.5769236909.
The spelling of 4496838672 in words is "four billion, four hundred ninety-six million, eight hundred thirty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •