Base | Representation |
---|---|
bin | 1011011011001001… |
… | …1011100010000001 |
3 | 21220201111010212220 |
4 | 2312302123202001 |
5 | 22240032021111 |
6 | 1224145241253 |
7 | 135665202300 |
oct | 26662334201 |
9 | 7821433786 |
10 | 3066673281 |
11 | 133406a031 |
12 | 717033229 |
13 | 39b459a99 |
14 | 211400437 |
15 | 12e363e06 |
hex | b6c9b881 |
3066673281 has 48 divisors (see below), whose sum is σ = 4875945984. Its totient is φ = 1708904736.
The previous prime is 3066673273. The next prime is 3066673289. The reversal of 3066673281 is 1823766603.
It is an interprime number because it is at equal distance from previous prime (3066673273) and next prime (3066673289).
It is not a de Polignac number, because 3066673281 - 23 = 3066673273 is a prime.
It is a super-2 number, since 2×30666732812 = 18808970024798609922, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (3066673289) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1012936 + ... + 1015958.
It is an arithmetic number, because the mean of its divisors is an integer number (101582208).
Almost surely, 23066673281 is an apocalyptic number.
It is an amenable number.
3066673281 is a deficient number, since it is larger than the sum of its proper divisors (1809272703).
3066673281 is a wasteful number, since it uses less digits than its factorization.
3066673281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3210 (or 3203 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 42.
The square root of 3066673281 is about 55377.5521398337. The cubic root of 3066673281 is about 1452.8557719500.
The spelling of 3066673281 in words is "three billion, sixty-six million, six hundred seventy-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •