Base | Representation |
---|---|
bin | 101000111010110… |
… | …1111010111000001 |
3 | 10112200121202200121 |
4 | 1101311233113001 |
5 | 10302444321423 |
6 | 344125020241 |
7 | 46011444142 |
oct | 12165572701 |
9 | 3480552617 |
10 | 1373042113 |
11 | 645056953 |
12 | 3239b4681 |
13 | 18b600371 |
14 | d04d5ac9 |
15 | 8081c45d |
hex | 51d6f5c1 |
1373042113 has 2 divisors, whose sum is σ = 1373042114. Its totient is φ = 1373042112.
The previous prime is 1373042101. The next prime is 1373042131. The reversal of 1373042113 is 3112403731.
Together with next prime (1373042131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 703681729 + 669360384 = 26527^2 + 25872^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1373042113 is a prime.
It is not a weakly prime, because it can be changed into another prime (1373042813) 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, 686521056 + 686521057.
It is an arithmetic number, because the mean of its divisors is an integer number (686521057).
Almost surely, 21373042113 is an apocalyptic number.
It is an amenable number.
1373042113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1373042113 is an equidigital number, since it uses as much as digits as its factorization.
1373042113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
The square root of 1373042113 is about 37054.5828879506. The cubic root of 1373042113 is about 1111.4620004281.
Adding to 1373042113 its reverse (3112403731), we get a palindrome (4485445844).
The spelling of 1373042113 in words is "one billion, three hundred seventy-three million, forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •