Base | Representation |
---|---|
bin | 1011010101101110… |
… | …0101010001100000 |
3 | 21212010122110221120 |
4 | 2311123211101200 |
5 | 22213220003111 |
6 | 1222013252240 |
7 | 135300531300 |
oct | 26533452140 |
9 | 7763573846 |
10 | 3043906656 |
11 | 132222a13a |
12 | 70b494080 |
13 | 3968182cb |
14 | 20c395600 |
15 | 12c368406 |
hex | b56e5460 |
3043906656 has 144 divisors (see below), whose sum is σ = 9413591040. Its totient is φ = 858574080.
The previous prime is 3043906631. The next prime is 3043906667. The reversal of 3043906656 is 6566093403.
It is a super-2 number, since 2×30439066562 = 18530735460882204672, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 367521 + ... + 375711.
It is an arithmetic number, because the mean of its divisors is an integer number (65372160).
Almost surely, 23043906656 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 3043906656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4706795520).
3043906656 is an abundant number, since it is smaller than the sum of its proper divisors (6369684384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3043906656 is a wasteful number, since it uses less digits than its factorization.
3043906656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8297 (or 8282 counting only the distinct ones).
The product of its (nonzero) digits is 349920, while the sum is 42.
The square root of 3043906656 is about 55171.6109607106. The cubic root of 3043906656 is about 1449.2515607955.
The spelling of 3043906656 in words is "three billion, forty-three million, nine hundred six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.090 sec. • engine limits •