Base | Representation |
---|---|
bin | 1011011101111101… |
… | …1011010111000000 |
3 | 21221112200102122110 |
4 | 2313133123113000 |
5 | 22301042002211 |
6 | 1225250135320 |
7 | 136200361305 |
oct | 26737332700 |
9 | 7845612573 |
10 | 3078469056 |
11 | 133a796403 |
12 | 71ab81540 |
13 | 3a0a29b30 |
14 | 212bd10ac |
15 | 1303e3ea6 |
hex | b77db5c0 |
3078469056 has 56 divisors (see below), whose sum is σ = 8771670544. Its totient is φ = 947220480.
The previous prime is 3078469007. The next prime is 3078469099. The reversal of 3078469056 is 6509648703.
It is a super-2 number, since 2×30784690562 = 18953943457499062272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 3078468996 and 3078469014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 614185 + ... + 619176.
It is an arithmetic number, because the mean of its divisors is an integer number (156636974).
Almost surely, 23078469056 is an apocalyptic number.
It is an amenable number.
3078469056 is an abundant number, since it is smaller than the sum of its proper divisors (5693201488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3078469056 is a wasteful number, since it uses less digits than its factorization.
3078469056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1233389 (or 1233379 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 48.
The square root of 3078469056 is about 55483.9531396241. The cubic root of 3078469056 is about 1454.7161629115.
The spelling of 3078469056 in words is "three billion, seventy-eight million, four hundred sixty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •