Base | Representation |
---|---|
bin | 11101110011111110101001… |
… | …100110011000010001110101 |
3 | 122012020111112112102001202000 |
4 | 131303332221212120101311 |
5 | 114141143124341233123 |
6 | 1142505313130005513 |
7 | 36421524442565130 |
oct | 3563765146302165 |
9 | 565214475361660 |
10 | 131115312055413 |
11 | 38860767539074 |
12 | 12857038876899 |
13 | 582117573857a |
14 | 245402d0bb217 |
15 | 102592444eb43 |
hex | 773fa9998475 |
131115312055413 has 64 divisors (see below), whose sum is σ = 222301988928000. Its totient is φ = 74819167810560.
The previous prime is 131115312055313. The next prime is 131115312055421. The reversal of 131115312055413 is 314550213511131.
131115312055413 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 1 + 5 + 31 + 205 + 5 + 413 = 666.
It is not a de Polignac number, because 131115312055413 - 29 = 131115312054901 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131115312055433) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1858464663 + ... + 1858535211.
It is an arithmetic number, because the mean of its divisors is an integer number (3473468577000).
Almost surely, 2131115312055413 is an apocalyptic number.
It is an amenable number.
131115312055413 is a deficient number, since it is larger than the sum of its proper divisors (91186676872587).
131115312055413 is a wasteful number, since it uses less digits than its factorization.
131115312055413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84059 (or 84053 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
Adding to 131115312055413 its reverse (314550213511131), we get a palindrome (445665525566544).
The spelling of 131115312055413 in words is "one hundred thirty-one trillion, one hundred fifteen billion, three hundred twelve million, fifty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •