Base | Representation |
---|---|
bin | 1011111100010110000001… |
… | …0100100010110100110101 |
3 | 1201111100021000222201000100 |
4 | 2333011200110202310311 |
5 | 3210120431220202013 |
6 | 43532241124104313 |
7 | 2523464424022632 |
oct | 277054024426465 |
9 | 51440230881010 |
10 | 13131331022133 |
11 | 4202a6a035515 |
12 | 1580b34235099 |
13 | 74338253a1bc |
14 | 3357ba1a9189 |
15 | 17b8992b7473 |
hex | bf160522d35 |
13131331022133 has 12 divisors (see below), whose sum is σ = 19207572804160. Its totient is φ = 8643407760936.
The previous prime is 13131331022101. The next prime is 13131331022141. The reversal of 13131331022133 is 33122013313131.
13131331022133 is a `hidden beast` number, since 1 + 3 + 1 + 313 + 310 + 2 + 2 + 1 + 33 = 666.
It is not a de Polignac number, because 13131331022133 - 25 = 13131331022101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13131331022097 and 13131331022106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131331022153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9234409291 + ... + 9234410712.
Almost surely, 213131331022133 is an apocalyptic number.
It is an amenable number.
13131331022133 is a deficient number, since it is larger than the sum of its proper divisors (6076241782027).
13131331022133 is a wasteful number, since it uses less digits than its factorization.
13131331022133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18468820088 (or 18468820085 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 13131331022133 its reverse (33122013313131), we get a palindrome (46253344335264).
The spelling of 13131331022133 in words is "thirteen trillion, one hundred thirty-one billion, three hundred thirty-one million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.656 sec. • engine limits •