Base | Representation |
---|---|
bin | 11101111000011100101001… |
… | …100110110001011011110001 |
3 | 122020022212012011220212011102 |
4 | 131320130221212301123301 |
5 | 114211211034443220423 |
6 | 1143302341304054145 |
7 | 36452645434014242 |
oct | 3570345146613361 |
9 | 566285164825142 |
10 | 131422402320113 |
11 | 38969a22a31163 |
12 | 128a6660764355 |
13 | 5844105485678 |
14 | 2464c41b54cc9 |
15 | 102d8e9307c28 |
hex | 7787299b16f1 |
131422402320113 has 8 divisors (see below), whose sum is σ = 131861404526400. Its totient is φ = 130983553702480.
The previous prime is 131422402320049. The next prime is 131422402320257. The reversal of 131422402320113 is 311023204224131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131422402320113 - 26 = 131422402320049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131422402310113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36682823 + ... + 40105788.
It is an arithmetic number, because the mean of its divisors is an integer number (16482675565800).
Almost surely, 2131422402320113 is an apocalyptic number.
It is an amenable number.
131422402320113 is a deficient number, since it is larger than the sum of its proper divisors (439002206287).
131422402320113 is an equidigital number, since it uses as much as digits as its factorization.
131422402320113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76794327.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 131422402320113 its reverse (311023204224131), we get a palindrome (442445606544244).
The spelling of 131422402320113 in words is "one hundred thirty-one trillion, four hundred twenty-two billion, four hundred two million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •