Base | Representation |
---|---|
bin | 1011101101000001… |
… | …0001101101000101 |
3 | 22002221111010112200 |
4 | 2323100101231011 |
5 | 22413222344323 |
6 | 1235423305113 |
7 | 140565132534 |
oct | 27320215505 |
9 | 8087433480 |
10 | 3141606213 |
11 | 137239a279 |
12 | 73814b199 |
13 | 3b0b349b5 |
14 | 21b34831b |
15 | 135c16443 |
hex | bb411b45 |
3141606213 has 12 divisors (see below), whose sum is σ = 4550882700. Its totient is φ = 2088400896.
The previous prime is 3141606211. The next prime is 3141606241. The reversal of 3141606213 is 3126061413.
3141606213 is a `hidden beast` number, since 3 + 1 + 41 + 606 + 2 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2669065569 + 472540644 = 51663^2 + 21738^2 .
It is not a de Polignac number, because 3141606213 - 21 = 3141606211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3141606211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 496956 + ... + 503237.
It is an arithmetic number, because the mean of its divisors is an integer number (379240225).
Almost surely, 23141606213 is an apocalyptic number.
It is an amenable number.
3141606213 is a deficient number, since it is larger than the sum of its proper divisors (1409276487).
3141606213 is a wasteful number, since it uses less digits than its factorization.
3141606213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000548 (or 1000545 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 3141606213 is about 56050.0331222025. The cubic root of 3141606213 is about 1464.5939946641.
Adding to 3141606213 its reverse (3126061413), we get a palindrome (6267667626).
The spelling of 3141606213 in words is "three billion, one hundred forty-one million, six hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •