Base | Representation |
---|---|
bin | 100111000111100… |
… | …1011010000101011 |
3 | 10101110220001020201 |
4 | 1032033023100223 |
5 | 10142011214011 |
6 | 334125333031 |
7 | 44345632312 |
oct | 11617132053 |
9 | 3343801221 |
10 | 1312601131 |
11 | 613a24726 |
12 | 307707177 |
13 | 17bc2a77a |
14 | c6481279 |
15 | 7a37dcc1 |
hex | 4e3cb42b |
1312601131 has 4 divisors (see below), whose sum is σ = 1316028672. Its totient is φ = 1309173592.
The previous prime is 1312601123. The next prime is 1312601137. The reversal of 1312601131 is 1311062131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1312601131 - 23 = 1312601123 is a prime.
It is a super-2 number, since 2×13126011312 = 3445843458204958322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1312601099 and 1312601108.
It is not an unprimeable number, because it can be changed into a prime (1312601137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1713196 + ... + 1713961.
It is an arithmetic number, because the mean of its divisors is an integer number (329007168).
Almost surely, 21312601131 is an apocalyptic number.
1312601131 is a deficient number, since it is larger than the sum of its proper divisors (3427541).
1312601131 is an equidigital number, since it uses as much as digits as its factorization.
1312601131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3427540.
The product of its (nonzero) digits is 108, while the sum is 19.
The square root of 1312601131 is about 36229.8375789901. The cubic root of 1312601131 is about 1094.9079052117.
Adding to 1312601131 its reverse (1311062131), we get a palindrome (2623663262).
The spelling of 1312601131 in words is "one billion, three hundred twelve million, six hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •