Base | Representation |
---|---|
bin | 100111010000100… |
… | …1011110110011101 |
3 | 10101210202220020221 |
4 | 1032201023312131 |
5 | 10144213302031 |
6 | 334414441341 |
7 | 44434024222 |
oct | 11641136635 |
9 | 3353686227 |
10 | 1317322141 |
11 | 616659693 |
12 | 309203251 |
13 | 17cbc1575 |
14 | c6d4d949 |
15 | 7a9b2a11 |
hex | 4e84bd9d |
1317322141 has 4 divisors (see below), whose sum is σ = 1317500352. Its totient is φ = 1317143932.
The previous prime is 1317322081. The next prime is 1317322213. The reversal of 1317322141 is 1412237131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1317322141 - 223 = 1308933533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1317322841) 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 in 3 ways as a sum of consecutive naturals, for example, 77515 + ... + 92968.
It is an arithmetic number, because the mean of its divisors is an integer number (329375088).
Almost surely, 21317322141 is an apocalyptic number.
It is an amenable number.
1317322141 is a deficient number, since it is larger than the sum of its proper divisors (178211).
1317322141 is an equidigital number, since it uses as much as digits as its factorization.
1317322141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178210.
The product of its digits is 1008, while the sum is 25.
The square root of 1317322141 is about 36294.9327179429. The cubic root of 1317322141 is about 1096.2190134204.
Adding to 1317322141 its reverse (1412237131), we get a palindrome (2729559272).
The spelling of 1317322141 in words is "one billion, three hundred seventeen million, three hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •