Base | Representation |
---|---|
bin | 1011011111010111… |
… | …1100001001011001 |
3 | 21221221210020221020 |
4 | 2313311330021121 |
5 | 22304044324041 |
6 | 1230020433053 |
7 | 136301500611 |
oct | 26765741131 |
9 | 7857706836 |
10 | 3084370521 |
11 | 1343057251 |
12 | 720b48789 |
13 | 3a201501b |
14 | 2138c9a41 |
15 | 130bac866 |
hex | b7d7c259 |
3084370521 has 12 divisors (see below), whose sum is σ = 4210365168. Its totient is φ = 2008423704.
The previous prime is 3084370507. The next prime is 3084370559. The reversal of 3084370521 is 1250734803.
It is not a de Polignac number, because 3084370521 - 214 = 3084354137 is a prime.
It is a super-2 number, since 2×30843705212 = 19026683021627622882, which contains 22 as substring.
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (3084370021) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 272475 + ... + 283568.
It is an arithmetic number, because the mean of its divisors is an integer number (350863764).
Almost surely, 23084370521 is an apocalyptic number.
It is an amenable number.
3084370521 is a deficient number, since it is larger than the sum of its proper divisors (1125994647).
3084370521 is an equidigital number, since it uses as much as digits as its factorization.
3084370521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556132 (or 556089 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 3084370521 is about 55537.1094044334. The cubic root of 3084370521 is about 1455.6451394444.
The spelling of 3084370521 in words is "three billion, eighty-four million, three hundred seventy thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •