Base | Representation |
---|---|
bin | 10011000100001001111… |
… | …001001110000101011001 |
3 | 11122020200021122121011121 |
4 | 103010021321032011121 |
5 | 132431122020120441 |
6 | 2441511010325241 |
7 | 163440160633240 |
oct | 23041171160531 |
9 | 4566607577147 |
10 | 1310131020121 |
11 | 4656948955a0 |
12 | 191ab4289821 |
13 | 96710c997c1 |
14 | 475a6c95957 |
15 | 2412d563dd1 |
hex | 13109e4e159 |
1310131020121 has 16 divisors (see below), whose sum is σ = 1642851796608. Its totient is φ = 1014980256000.
The previous prime is 1310131020113. The next prime is 1310131020179. The reversal of 1310131020121 is 1210201310131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1310131020121 - 23 = 1310131020113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1310131020095 and 1310131020104.
It is not an unprimeable number, because it can be changed into a prime (1310131020181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49162080 + ... + 49188721.
It is an arithmetic number, because the mean of its divisors is an integer number (102678237288).
Almost surely, 21310131020121 is an apocalyptic number.
1310131020121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1310131020121 is a deficient number, since it is larger than the sum of its proper divisors (332720776487).
1310131020121 is a wasteful number, since it uses less digits than its factorization.
1310131020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98350992.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1310131020121 its reverse (1210201310131), we get a palindrome (2520332330252).
The spelling of 1310131020121 in words is "one trillion, three hundred ten billion, one hundred thirty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •