Base | Representation |
---|---|
bin | 11101110011000110101010… |
… | …101111001111010011111101 |
3 | 122012000202101100000012120000 |
4 | 131303012222233033103331 |
5 | 114134202023103104203 |
6 | 1142421532314344513 |
7 | 36414266032344054 |
oct | 3563065257172375 |
9 | 565022340005500 |
10 | 131055201613053 |
11 | 38838220788033 |
12 | 12847461a2b139 |
13 | 58185b614c893 |
14 | 2451169ab939b |
15 | 10240a71834a3 |
hex | 7731aabcf4fd |
131055201613053 has 80 divisors (see below), whose sum is σ = 199899941472000. Its totient is φ = 85545903824640.
The previous prime is 131055201613051. The next prime is 131055201613087. The reversal of 131055201613053 is 350316102550131.
131055201613053 is a `hidden beast` number, since 1 + 3 + 10 + 5 + 5 + 20 + 1 + 613 + 0 + 5 + 3 = 666.
It is not a de Polignac number, because 131055201613053 - 21 = 131055201613051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131055201612999 and 131055201613017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131055201613051) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 6477289425 + ... + 6477309657.
It is an arithmetic number, because the mean of its divisors is an integer number (2498749268400).
Almost surely, 2131055201613053 is an apocalyptic number.
It is an amenable number.
131055201613053 is a deficient number, since it is larger than the sum of its proper divisors (68844739858947).
131055201613053 is a wasteful number, since it uses less digits than its factorization.
131055201613053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28024 (or 28015 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 36.
The spelling of 131055201613053 in words is "one hundred thirty-one trillion, fifty-five billion, two hundred one million, six hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •