Base | Representation |
---|---|
bin | 1011101010110010… |
… | …0011000010010101 |
3 | 22002021212021112200 |
4 | 2322230203002111 |
5 | 22403323140041 |
6 | 1234450435113 |
7 | 140422413051 |
oct | 27254430225 |
9 | 8067767480 |
10 | 3132240021 |
11 | 1368082319 |
12 | 734b92a99 |
13 | 3abc05781 |
14 | 219dcac61 |
15 | 134eb61b6 |
hex | bab23095 |
3132240021 has 24 divisors (see below), whose sum is σ = 4794992280. Its totient is φ = 1963478016.
The previous prime is 3132240011. The next prime is 3132240037. The reversal of 3132240021 is 1200422313.
It can be written as a sum of positive squares in 4 ways, for example, as 193515921 + 2938724100 = 13911^2 + 54210^2 .
It is not a de Polignac number, because 3132240021 - 27 = 3132239893 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3132239976 and 3132240003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3132240011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 163671 + ... + 181803.
It is an arithmetic number, because the mean of its divisors is an integer number (199791345).
Almost surely, 23132240021 is an apocalyptic number.
It is an amenable number.
3132240021 is a deficient number, since it is larger than the sum of its proper divisors (1662752259).
3132240021 is a wasteful number, since it uses less digits than its factorization.
3132240021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19285 (or 19282 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 3132240021 is about 55966.4186901395. The cubic root of 3132240021 is about 1463.1370622769.
Adding to 3132240021 its reverse (1200422313), we get a palindrome (4332662334).
The spelling of 3132240021 in words is "three billion, one hundred thirty-two million, two hundred forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •