Base | Representation |
---|---|
bin | 100111001010010… |
… | …0011101001111011 |
3 | 10101120112201021122 |
4 | 1032110203221323 |
5 | 10142341334041 |
6 | 334215455455 |
7 | 44363626052 |
oct | 11624435173 |
9 | 3346481248 |
10 | 1314011771 |
11 | 6147a8546 |
12 | 30808758b |
13 | 17c302877 |
14 | c672b399 |
15 | 7a55bc4b |
hex | 4e523a7b |
1314011771 has 4 divisors (see below), whose sum is σ = 1319464344. Its totient is φ = 1308559200.
The previous prime is 1314011767. The next prime is 1314011791. The reversal of 1314011771 is 1771104131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1771104131 = 877 ⋅2019503.
It is a cyclic number.
It is not a de Polignac number, because 1314011771 - 22 = 1314011767 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1314011771.
It is not an unprimeable number, because it can be changed into a prime (1314011701) 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, 2725925 + ... + 2726406.
It is an arithmetic number, because the mean of its divisors is an integer number (329866086).
Almost surely, 21314011771 is an apocalyptic number.
1314011771 is a deficient number, since it is larger than the sum of its proper divisors (5452573).
1314011771 is an equidigital number, since it uses as much as digits as its factorization.
1314011771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5452572.
The product of its (nonzero) digits is 588, while the sum is 26.
The square root of 1314011771 is about 36249.3002829020. The cubic root of 1314011771 is about 1095.2999938381.
The spelling of 1314011771 in words is "one billion, three hundred fourteen million, eleven thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •