Base | Representation |
---|---|
bin | 1011110111011010… |
… | …0011100010000101 |
3 | 22012222111200022102 |
4 | 2331312203202011 |
5 | 23010402221031 |
6 | 1244021441445 |
7 | 141634466132 |
oct | 27566434205 |
9 | 8188450272 |
10 | 3185195141 |
11 | 1394a61287 |
12 | 74a870285 |
13 | 3b9b86c6b |
14 | 223053589 |
15 | 1399767cb |
hex | bdda3885 |
3185195141 has 2 divisors, whose sum is σ = 3185195142. Its totient is φ = 3185195140.
The previous prime is 3185195053. The next prime is 3185195149. The reversal of 3185195141 is 1415915813.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2920970116 + 264225025 = 54046^2 + 16255^2 .
It is a cyclic number.
It is not a de Polignac number, because 3185195141 - 214 = 3185178757 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3185195095 and 3185195104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3185195149) 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 as a sum of consecutive naturals, namely, 1592597570 + 1592597571.
It is an arithmetic number, because the mean of its divisors is an integer number (1592597571).
Almost surely, 23185195141 is an apocalyptic number.
It is an amenable number.
3185195141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3185195141 is an equidigital number, since it uses as much as digits as its factorization.
3185195141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21600, while the sum is 38.
The square root of 3185195141 is about 56437.5330874765. The cubic root of 3185195141 is about 1471.3365204448.
The spelling of 3185195141 in words is "three billion, one hundred eighty-five million, one hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •