Base | Representation |
---|---|
bin | 1011101100110000… |
… | …0011111101110011 |
3 | 22002212101222222022 |
4 | 2323030003331303 |
5 | 22412432020423 |
6 | 1235343502055 |
7 | 140552551436 |
oct | 27314037563 |
9 | 8085358868 |
10 | 3140501363 |
11 | 137180517a |
12 | 7378b792b |
13 | 3b0838b3c |
14 | 21b13b81d |
15 | 135a98dc8 |
hex | bb303f73 |
3140501363 has 2 divisors, whose sum is σ = 3140501364. Its totient is φ = 3140501362.
The previous prime is 3140501297. The next prime is 3140501389. The reversal of 3140501363 is 3631050413.
It is an a-pointer prime, because the next prime (3140501389) can be obtained adding 3140501363 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3140501363 - 28 = 3140501107 is a prime.
It is a super-2 number, since 2×31405013632 = 19725497622009715538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3140501863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570250681 + 1570250682.
It is an arithmetic number, because the mean of its divisors is an integer number (1570250682).
Almost surely, 23140501363 is an apocalyptic number.
3140501363 is a deficient number, since it is larger than the sum of its proper divisors (1).
3140501363 is an equidigital number, since it uses as much as digits as its factorization.
3140501363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 26.
The square root of 3140501363 is about 56040.1763291302. The cubic root of 3140501363 is about 1464.4222835185.
Adding to 3140501363 its reverse (3631050413), we get a palindrome (6771551776).
The spelling of 3140501363 in words is "three billion, one hundred forty million, five hundred one thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •