Base | Representation |
---|---|
bin | 1011001110011001… |
… | …1111100001010001 |
3 | 21202222220001010101 |
4 | 2303212133201101 |
5 | 22132340242431 |
6 | 1214555332401 |
7 | 134445611224 |
oct | 26346374121 |
9 | 7688801111 |
10 | 3013212241 |
11 | 1306974a56 |
12 | 701151101 |
13 | 39035c230 |
14 | 2082855bb |
15 | 129803961 |
hex | b399f851 |
3013212241 has 16 divisors (see below), whose sum is σ = 3284123920. Its totient is φ = 2748038400.
The previous prime is 3013212227. The next prime is 3013212247. The reversal of 3013212241 is 1422123103.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 43507216 + 2969705025 = 6596^2 + 54495^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3013212241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3013212247) 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 15 ways as a sum of consecutive naturals, for example, 525691 + ... + 531391.
It is an arithmetic number, because the mean of its divisors is an integer number (205257745).
Almost surely, 23013212241 is an apocalyptic number.
It is an amenable number.
3013212241 is a deficient number, since it is larger than the sum of its proper divisors (270911679).
3013212241 is a wasteful number, since it uses less digits than its factorization.
3013212241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6196.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 3013212241 is about 54892.7339545044. The cubic root of 3013212241 is about 1444.3637306836.
Adding to 3013212241 its reverse (1422123103), we get a palindrome (4435335344).
The spelling of 3013212241 in words is "three billion, thirteen million, two hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •