Base | Representation |
---|---|
bin | 11101110110110101000001… |
… | …010001110000000100101001 |
3 | 122012221012222110000020001211 |
4 | 131312311001101300010221 |
5 | 114202400143330004001 |
6 | 1143135300034513121 |
7 | 36441626135402242 |
oct | 3566650121600451 |
9 | 565835873006054 |
10 | 131311130313001 |
11 | 38926812873301 |
12 | 12888b87a357a1 |
13 | 58367815a2042 |
14 | 245d6c7a59cc9 |
15 | 102aa856ee351 |
hex | 776d41470129 |
131311130313001 has 16 divisors (see below), whose sum is σ = 133647409821888. Its totient is φ = 128980894996800.
The previous prime is 131311130312959. The next prime is 131311130313031. The reversal of 131311130313001 is 100313031113131.
It is a cyclic number.
It is not a de Polignac number, because 131311130313001 - 29 = 131311130312489 is a prime.
It is a super-2 number, since 2×1313111303130012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131311130313031) 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, 130777791 + ... + 131778043.
It is an arithmetic number, because the mean of its divisors is an integer number (8352963113868).
Almost surely, 2131311130313001 is an apocalyptic number.
It is an amenable number.
131311130313001 is a deficient number, since it is larger than the sum of its proper divisors (2336279508887).
131311130313001 is a wasteful number, since it uses less digits than its factorization.
131311130313001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003272.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 131311130313001 its reverse (100313031113131), we get a palindrome (231624161426132).
The spelling of 131311130313001 in words is "one hundred thirty-one trillion, three hundred eleven billion, one hundred thirty million, three hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •