Base | Representation |
---|---|
bin | 10011000100001010001… |
… | …101011001100101110011 |
3 | 11122020200122121100200220 |
4 | 103010022031121211303 |
5 | 132431124343411011 |
6 | 2441511315544123 |
7 | 163440253615065 |
oct | 23041215314563 |
9 | 4566618540626 |
10 | 1310136310131 |
11 | 465697879000 |
12 | 191ab5bbb043 |
13 | 967120cc59c |
14 | 475a7871735 |
15 | 2412dc5b506 |
hex | 1310a359973 |
1310136310131 has 32 divisors (see below), whose sum is σ = 1973332018176. Its totient is φ = 772561864800.
The previous prime is 1310136310129. The next prime is 1310136310261.
1310136310131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1310136310131 - 21 = 1310136310129 is a prime.
It is a super-2 number, since 2×13101363101312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1310136310111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4286155 + ... + 4581636.
It is an arithmetic number, because the mean of its divisors is an integer number (61666625568).
Almost surely, 21310136310131 is an apocalyptic number.
1310136310131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1310136310131 is a deficient number, since it is larger than the sum of its proper divisors (663195708045).
1310136310131 is an equidigital number, since it uses as much as digits as its factorization.
1310136310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8867864 (or 8867842 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 24.
The spelling of 1310136310131 in words is "one trillion, three hundred ten billion, one hundred thirty-six million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •