Base | Representation |
---|---|
bin | 10011000100001000001… |
… | …100011110011111000001 |
3 | 11122020121022000022120120 |
4 | 103010020030132133001 |
5 | 132431042220413401 |
6 | 2441504111330453 |
7 | 163436363424660 |
oct | 23041014363701 |
9 | 4566538008516 |
10 | 1310102513601 |
11 | 46567a795192 |
12 | 191aa6820a29 |
13 | 967080c853b |
14 | 475a3194dd7 |
15 | 2412acd2836 |
hex | 1310831e7c1 |
1310102513601 has 8 divisors (see below), whose sum is σ = 1996346687424. Its totient is φ = 748630007760.
The previous prime is 1310102513581. The next prime is 1310102513627. The reversal of 1310102513601 is 1063152010131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1310102513601 - 25 = 1310102513569 is a prime.
It is a super-2 number, since 2×13101025136012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1310102514601) 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 7 ways as a sum of consecutive naturals, for example, 31192916970 + ... + 31192917011.
It is an arithmetic number, because the mean of its divisors is an integer number (249543335928).
Almost surely, 21310102513601 is an apocalyptic number.
It is an amenable number.
1310102513601 is a deficient number, since it is larger than the sum of its proper divisors (686244173823).
1310102513601 is an equidigital number, since it uses as much as digits as its factorization.
1310102513601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62385833991.
The product of its (nonzero) digits is 540, while the sum is 24.
Adding to 1310102513601 its reverse (1063152010131), we get a palindrome (2373254523732).
The spelling of 1310102513601 in words is "one trillion, three hundred ten billion, one hundred two million, five hundred thirteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •