Base | Representation |
---|---|
bin | 1011011101100100… |
… | …0011000000100000 |
3 | 21221102112110021000 |
4 | 2313121003000200 |
5 | 22300124441243 |
6 | 1225150232000 |
7 | 136150224015 |
oct | 26731030040 |
9 | 7842473230 |
10 | 3076796448 |
11 | 1339853790 |
12 | 71a4b5600 |
13 | 3a059271b |
14 | 2128b770c |
15 | 1301b35d3 |
hex | b7643020 |
3076796448 has 192 divisors, whose sum is σ = 9824371200. Its totient is φ = 929076480.
The previous prime is 3076796417. The next prime is 3076796461. The reversal of 3076796448 is 8446976703.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 3076796394 and 3076796403.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4970283 + ... + 4970901.
It is an arithmetic number, because the mean of its divisors is an integer number (51168600).
Almost surely, 23076796448 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 3076796448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4912185600).
3076796448 is an abundant number, since it is smaller than the sum of its proper divisors (6747574752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3076796448 is a wasteful number, since it uses less digits than its factorization.
3076796448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1172 (or 1158 counting only the distinct ones).
The product of its (nonzero) digits is 6096384, while the sum is 54.
The square root of 3076796448 is about 55468.8781930913. The cubic root of 3076796448 is about 1454.4526541514.
The spelling of 3076796448 in words is "three billion, seventy-six million, seven hundred ninety-six thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •