Base | Representation |
---|---|
bin | 1011101011010001… |
… | …1100101001100101 |
3 | 22002102202111102002 |
4 | 2322310130221211 |
5 | 22404340423023 |
6 | 1235003055045 |
7 | 140446126661 |
oct | 27264345145 |
9 | 8072674362 |
10 | 3134311013 |
11 | 1369267289 |
12 | 735811485 |
13 | 3ac47c302 |
14 | 21a3a98a1 |
15 | 135274b28 |
hex | bad1ca65 |
3134311013 has 2 divisors, whose sum is σ = 3134311014. Its totient is φ = 3134311012.
The previous prime is 3134311007. The next prime is 3134311021. The reversal of 3134311013 is 3101134313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3036340609 + 97970404 = 55103^2 + 9898^2 .
It is an emirp because it is prime and its reverse (3101134313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3134311013 - 24 = 3134310997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3134314013) 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, 1567155506 + 1567155507.
It is an arithmetic number, because the mean of its divisors is an integer number (1567155507).
Almost surely, 23134311013 is an apocalyptic number.
It is an amenable number.
3134311013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3134311013 is an equidigital number, since it uses as much as digits as its factorization.
3134311013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
The square root of 3134311013 is about 55984.9177279024. The cubic root of 3134311013 is about 1463.4594596183.
Adding to 3134311013 its reverse (3101134313), we get a palindrome (6235445326).
The spelling of 3134311013 in words is "three billion, one hundred thirty-four million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •