Base | Representation |
---|---|
bin | 1011011011000011… |
… | …0011110101110000 |
3 | 21220200200120021111 |
4 | 2312300303311300 |
5 | 22234424423220 |
6 | 1224132203104 |
7 | 135661453114 |
oct | 26660636560 |
9 | 7820616244 |
10 | 3066248560 |
11 | 13338a9a21 |
12 | 716a69494 |
13 | 39b33b67b |
14 | 21132d744 |
15 | 12e2cd15a |
hex | b6c33d70 |
3066248560 has 20 divisors (see below), whose sum is σ = 7129028088. Its totient is φ = 1226499392.
The previous prime is 3066248551. The next prime is 3066248569. The reversal of 3066248560 is 658426603.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (3066248551) and next prime (3066248569).
It is a tau number, because it is divible by the number of its divisors (20).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3066248569) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 19163974 + ... + 19164133.
Almost surely, 23066248560 is an apocalyptic number.
It is an amenable number.
3066248560 is an abundant number, since it is smaller than the sum of its proper divisors (4062779528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3066248560 is a wasteful number, since it uses less digits than its factorization.
3066248560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38328120 (or 38328114 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 40.
The square root of 3066248560 is about 55373.7172311919. The cubic root of 3066248560 is about 1452.7886974376.
The spelling of 3066248560 in words is "three billion, sixty-six million, two hundred forty-eight thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •