Base | Representation |
---|---|
bin | 10011000100010100110… |
… | …000100100010010001011 |
3 | 11122021010222122102201010 |
4 | 103010110300210102023 |
5 | 132432010201114011 |
6 | 2441541041255003 |
7 | 163444533201612 |
oct | 23042460442213 |
9 | 4567128572633 |
10 | 1310313301131 |
11 | 465778775a5a |
12 | 191b45334463 |
13 | 9673c98b9a3 |
14 | 475c3184879 |
15 | 2413e56d1a6 |
hex | 13114c2448b |
1310313301131 has 8 divisors (see below), whose sum is σ = 1748685766464. Its totient is φ = 872741518280.
The previous prime is 1310313301127. The next prime is 1310313301133. The reversal of 1310313301131 is 1311033130131.
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 1310313301131 - 22 = 1310313301127 is a prime.
It is a super-2 number, since 2×13103133011312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310313301098 and 1310313301107.
It is not an unprimeable number, because it can be changed into a prime (1310313301133) 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, 200166801 + ... + 200173346.
It is an arithmetic number, because the mean of its divisors is an integer number (218585720808).
Almost surely, 21310313301131 is an apocalyptic number.
1310313301131 is a deficient number, since it is larger than the sum of its proper divisors (438372465333).
1310313301131 is a wasteful number, since it uses less digits than its factorization.
1310313301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400341241.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 1310313301131 its reverse (1311033130131), we get a palindrome (2621346431262).
The spelling of 1310313301131 in words is "one trillion, three hundred ten billion, three hundred thirteen million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •