Base | Representation |
---|---|
bin | 100110111010111… |
… | …1000100110101001 |
3 | 10101000102012120111 |
4 | 1031311320212221 |
5 | 10133312033423 |
6 | 333331254321 |
7 | 44235366646 |
oct | 11565704651 |
9 | 3330365514 |
10 | 1305971113 |
11 | 610206477 |
12 | 30544a3a1 |
13 | 17a748a95 |
14 | c5636dcd |
15 | 799be60d |
hex | 4dd789a9 |
1305971113 has 2 divisors, whose sum is σ = 1305971114. Its totient is φ = 1305971112.
The previous prime is 1305971111. The next prime is 1305971141. The reversal of 1305971113 is 3111795031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 917605264 + 388365849 = 30292^2 + 19707^2 .
It is an emirp because it is prime and its reverse (3111795031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1305971113 - 21 = 1305971111 is a prime.
Together with 1305971111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1305971111) 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, 652985556 + 652985557.
It is an arithmetic number, because the mean of its divisors is an integer number (652985557).
Almost surely, 21305971113 is an apocalyptic number.
It is an amenable number.
1305971113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1305971113 is an equidigital number, since it uses as much as digits as its factorization.
1305971113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 31.
The square root of 1305971113 is about 36138.2223276132. Note that the first 3 decimals coincide. The cubic root of 1305971113 is about 1093.0613133154.
The spelling of 1305971113 in words is "one billion, three hundred five million, nine hundred seventy-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •