Base | Representation |
---|---|
bin | 1011001110100111… |
… | …1101011010011001 |
3 | 21210001121012212022 |
4 | 2303221331122121 |
5 | 22133103333423 |
6 | 1215031024225 |
7 | 134456415053 |
oct | 26351753231 |
9 | 7701535768 |
10 | 3014121113 |
11 | 1307435893 |
12 | 70150b075 |
13 | 3905b9b23 |
14 | 2084408d3 |
15 | 129932dc8 |
hex | b3a7d699 |
3014121113 has 2 divisors, whose sum is σ = 3014121114. Its totient is φ = 3014121112.
The previous prime is 3014121067. The next prime is 3014121127. The reversal of 3014121113 is 3111214103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2610392464 + 403728649 = 51092^2 + 20093^2 .
It is a cyclic number.
It is not a de Polignac number, because 3014121113 - 230 = 1940379289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3014121091 and 3014121100.
It is not a weakly prime, because it can be changed into another prime (3014121193) 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, 1507060556 + 1507060557.
It is an arithmetic number, because the mean of its divisors is an integer number (1507060557).
Almost surely, 23014121113 is an apocalyptic number.
It is an amenable number.
3014121113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3014121113 is an equidigital number, since it uses as much as digits as its factorization.
3014121113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 3014121113 is about 54901.0119487792. The cubic root of 3014121113 is about 1444.5089367166.
Adding to 3014121113 its reverse (3111214103), we get a palindrome (6125335216).
The spelling of 3014121113 in words is "three billion, fourteen million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •