Base | Representation |
---|---|
bin | 11101110110110101000000… |
… | …101010111010110010110101 |
3 | 122012221012221201212001010220 |
4 | 131312311000222322302311 |
5 | 114202400133223231201 |
6 | 1143135255032404553 |
7 | 36441625653023643 |
oct | 3566650052726265 |
9 | 565835851761126 |
10 | 131311120133301 |
11 | 38926808050129 |
12 | 12888b84546759 |
13 | 583677c449754 |
14 | 245d6c656a193 |
15 | 102aa8488d036 |
hex | 776d40abacb5 |
131311120133301 has 16 divisors (see below), whose sum is σ = 191772832651200. Its totient is φ = 79550212060928.
The previous prime is 131311120133269. The next prime is 131311120133309. The reversal of 131311120133301 is 103331021113131.
It is a cyclic number.
It is not a de Polignac number, because 131311120133301 - 25 = 131311120133269 is a prime.
It is a super-2 number, since 2×1313111201333012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131311120133309) 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, 44391857931 + ... + 44391860888.
It is an arithmetic number, because the mean of its divisors is an integer number (11985802040700).
Almost surely, 2131311120133301 is an apocalyptic number.
It is an amenable number.
131311120133301 is a deficient number, since it is larger than the sum of its proper divisors (60461712517899).
131311120133301 is a wasteful number, since it uses less digits than its factorization.
131311120133301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88783718868.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 131311120133301 its reverse (103331021113131), we get a palindrome (234642141246432).
The spelling of 131311120133301 in words is "one hundred thirty-one trillion, three hundred eleven billion, one hundred twenty million, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •