Base | Representation |
---|---|
bin | 100111001010111… |
… | …0111100110111001 |
3 | 10101121012011222120 |
4 | 1032111313212321 |
5 | 10142433340031 |
6 | 334231111453 |
7 | 44366560434 |
oct | 11625674671 |
9 | 3347164876 |
10 | 1314355641 |
11 | 614a12935 |
12 | 308212589 |
13 | 17c3c3241 |
14 | c67ba81b |
15 | 7a5c8a96 |
hex | 4e5779b9 |
1314355641 has 4 divisors (see below), whose sum is σ = 1752474192. Its totient is φ = 876237092.
The previous prime is 1314355597. The next prime is 1314355643. The reversal of 1314355641 is 1465534131.
It is a happy number.
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 1314355641 - 27 = 1314355513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1314355643) 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 in 3 ways as a sum of consecutive naturals, for example, 219059271 + ... + 219059276.
It is an arithmetic number, because the mean of its divisors is an integer number (438118548).
Almost surely, 21314355641 is an apocalyptic number.
It is an amenable number.
1314355641 is a deficient number, since it is larger than the sum of its proper divisors (438118551).
1314355641 is an equidigital number, since it uses as much as digits as its factorization.
1314355641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438118550.
The product of its digits is 21600, while the sum is 33.
The square root of 1314355641 is about 36254.0430986669. The cubic root of 1314355641 is about 1095.3955302625.
Adding to 1314355641 its reverse (1465534131), we get a palindrome (2779889772).
The spelling of 1314355641 in words is "one billion, three hundred fourteen million, three hundred fifty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •