Base | Representation |
---|---|
bin | 1011111101001011… |
… | …0111000000001101 |
3 | 22021200001000100121 |
4 | 2333102313000031 |
5 | 23033101022031 |
6 | 1250244224541 |
7 | 142350245254 |
oct | 27722670015 |
9 | 8250030317 |
10 | 3209392141 |
11 | 13a76888aa |
12 | 75699b151 |
13 | 3c1ba9807 |
14 | 22635179b |
15 | 13bb56011 |
hex | bf4b700d |
3209392141 has 16 divisors (see below), whose sum is σ = 3445977600. Its totient is φ = 2978373888.
The previous prime is 3209392129. The next prime is 3209392169. The reversal of 3209392141 is 1412939023.
It is not a de Polignac number, because 3209392141 - 27 = 3209392013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3209392097 and 3209392106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3209392181) 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, 414655 + ... + 422323.
It is an arithmetic number, because the mean of its divisors is an integer number (215373600).
Almost surely, 23209392141 is an apocalyptic number.
It is an amenable number.
3209392141 is a deficient number, since it is larger than the sum of its proper divisors (236585459).
3209392141 is a wasteful number, since it uses less digits than its factorization.
3209392141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8028.
The product of its (nonzero) digits is 11664, while the sum is 34.
The square root of 3209392141 is about 56651.4972529412. The cubic root of 3209392141 is about 1475.0528972316.
The spelling of 3209392141 in words is "three billion, two hundred nine million, three hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •