Base | Representation |
---|---|
bin | 100111001011011… |
… | …0101111100111101 |
3 | 10101121200011021111 |
4 | 1032112311330331 |
5 | 10143020023010 |
6 | 334240402021 |
7 | 44402003101 |
oct | 11626657475 |
9 | 3347604244 |
10 | 1314611005 |
11 | 615077784 |
12 | 308316311 |
13 | 17c482546 |
14 | c6845901 |
15 | 7a62958a |
hex | 4e5b5f3d |
1314611005 has 8 divisors (see below), whose sum is σ = 1578070872. Its totient is φ = 1051330368.
The previous prime is 1314610991. The next prime is 1314611029. The reversal of 1314611005 is 5001164131.
It can be written as a sum of positive squares in 4 ways, for example, as 98763844 + 1215847161 = 9938^2 + 34869^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1314611005 - 27 = 1314610877 is a prime.
It is a super-2 number, since 2×13146110052 = 3456404188934220050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28102 + ... + 58471.
It is an arithmetic number, because the mean of its divisors is an integer number (197258859).
Almost surely, 21314611005 is an apocalyptic number.
It is an amenable number.
1314611005 is a deficient number, since it is larger than the sum of its proper divisors (263459867).
1314611005 is an equidigital number, since it uses as much as digits as its factorization.
1314611005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89615.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 1314611005 is about 36257.5647968807. The cubic root of 1314611005 is about 1095.4664665352.
Adding to 1314611005 its reverse (5001164131), we get a palindrome (6315775136).
The spelling of 1314611005 in words is "one billion, three hundred fourteen million, six hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •