Base | Representation |
---|---|
bin | 1011011011001110… |
… | …1110100001111001 |
3 | 21220202010102020000 |
4 | 2312303232201321 |
5 | 22240123410431 |
6 | 1224200423213 |
7 | 136001116365 |
oct | 26663564171 |
9 | 7822112200 |
10 | 3067013241 |
11 | 1334281496 |
12 | 717177b09 |
13 | 39b548746 |
14 | 21148c2a5 |
15 | 12e3ce9e6 |
hex | b6cee879 |
3067013241 has 50 divisors (see below), whose sum is σ = 4849778010. Its totient is φ = 1930456800.
The previous prime is 3067013237. The next prime is 3067013249. The reversal of 3067013241 is 1423107603.
It can be written as a sum of positive squares in only one way, i.e., 1870130025 + 1196883216 = 43245^2 + 34596^2 .
It is not a de Polignac number, because 3067013241 - 22 = 3067013237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3067013249) 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 49 ways as a sum of consecutive naturals, for example, 74805181 + ... + 74805221.
Almost surely, 23067013241 is an apocalyptic number.
3067013241 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3067013241 is a deficient number, since it is larger than the sum of its proper divisors (1782764769).
3067013241 is an frugal number, since it uses more digits than its factorization.
3067013241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177 (or 75 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 3067013241 is about 55380.6215295567. The cubic root of 3067013241 is about 1452.9094560297.
The spelling of 3067013241 in words is "three billion, sixty-seven million, thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •