Base | Representation |
---|---|
bin | 100111000011001… |
… | …1100001011001001 |
3 | 10101022120200221020 |
4 | 1032012130023021 |
5 | 10140414423423 |
6 | 334004303053 |
7 | 44320314006 |
oct | 11606341311 |
9 | 3338520836 |
10 | 1310311113 |
11 | 612700151 |
12 | 3069a1a89 |
13 | 17b608327 |
14 | c60468ad |
15 | 7a07a4e3 |
hex | 4e19c2c9 |
1310311113 has 8 divisors (see below), whose sum is σ = 1754042976. Its totient is φ = 870060000.
The previous prime is 1310311097. The next prime is 1310311129. The reversal of 1310311113 is 3111130131.
It is an interprime number because it is at equal distance from previous prime (1310311097) and next prime (1310311129).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1310311113 - 24 = 1310311097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1310311092 and 1310311101.
It is not an unprimeable number, because it can be changed into a prime (1310311153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 869308 + ... + 870813.
It is an arithmetic number, because the mean of its divisors is an integer number (219255372).
Almost surely, 21310311113 is an apocalyptic number.
It is an amenable number.
1310311113 is a deficient number, since it is larger than the sum of its proper divisors (443731863).
1310311113 is a wasteful number, since it uses less digits than its factorization.
1310311113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1740375.
The product of its (nonzero) digits is 27, while the sum is 15.
The square root of 1310311113 is about 36198.2197490429. The cubic root of 1310311113 is about 1094.2707940807.
Adding to 1310311113 its reverse (3111130131), we get a palindrome (4421441244).
The spelling of 1310311113 in words is "one billion, three hundred ten million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •