Base | Representation |
---|---|
bin | 100111000010110… |
… | …1011100100011111 |
3 | 10101022012120211211 |
4 | 1032011223210133 |
5 | 10140342041111 |
6 | 334000125251 |
7 | 44315524414 |
oct | 11605534437 |
9 | 3338176754 |
10 | 1310112031 |
11 | 612584618 |
12 | 306906827 |
13 | 17b568827 |
14 | c5dd410b |
15 | 7a03b521 |
hex | 4e16b91f |
1310112031 has 4 divisors (see below), whose sum is σ = 1311523200. Its totient is φ = 1308700864.
The previous prime is 1310112029. The next prime is 1310112043. The reversal of 1310112031 is 1302110131.
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 1310112031 - 21 = 1310112029 is a prime.
It is a super-2 number, since 2×13101120312 = 3432787067541889922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310112631) 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, 704191 + ... + 706048.
It is an arithmetic number, because the mean of its divisors is an integer number (327880800).
Almost surely, 21310112031 is an apocalyptic number.
1310112031 is a deficient number, since it is larger than the sum of its proper divisors (1411169).
1310112031 is an equidigital number, since it uses as much as digits as its factorization.
1310112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411168.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1310112031 is about 36195.4697579683. The cubic root of 1310112031 is about 1094.2153719625.
Adding to 1310112031 its reverse (1302110131), we get a palindrome (2612222162).
The spelling of 1310112031 in words is "one billion, three hundred ten million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •