Base | Representation |
---|---|
bin | 1011001110011000… |
… | …1001100100100101 |
3 | 21202222201110210202 |
4 | 2303212021210211 |
5 | 22132324403331 |
6 | 1214553400245 |
7 | 134445055145 |
oct | 26346114445 |
9 | 7688643722 |
10 | 3013122341 |
11 | 1306913459 |
12 | 701109085 |
13 | 39032a338 |
14 | 208260925 |
15 | 1297d6ecb |
hex | b3989925 |
3013122341 has 2 divisors, whose sum is σ = 3013122342. Its totient is φ = 3013122340.
The previous prime is 3013122311. The next prime is 3013122361. The reversal of 3013122341 is 1432213103.
It is an a-pointer prime, because the next prime (3013122361) can be obtained adding 3013122341 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1922471716 + 1090650625 = 43846^2 + 33025^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013122341 - 218 = 3012860197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3013122311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506561170 + 1506561171.
It is an arithmetic number, because the mean of its divisors is an integer number (1506561171).
Almost surely, 23013122341 is an apocalyptic number.
It is an amenable number.
3013122341 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013122341 is an equidigital number, since it uses as much as digits as its factorization.
3013122341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 3013122341 is about 54891.9150786343. The cubic root of 3013122341 is about 1444.3493662136.
Adding to 3013122341 its reverse (1432213103), we get a palindrome (4445335444).
The spelling of 3013122341 in words is "three billion, thirteen million, one hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •