Base | Representation |
---|---|
bin | 1011111100100001001001… |
… | …1111110010011010011011 |
3 | 1201111121222100212110120100 |
4 | 2333020102133302122123 |
5 | 3210143042000022021 |
6 | 43533453511030443 |
7 | 2523631462416411 |
oct | 277102237623233 |
9 | 51447870773510 |
10 | 13134320314011 |
11 | 4204263451776 |
12 | 158162936b423 |
13 | 74373a942770 |
14 | 3359c11c52b1 |
15 | 17b9c1943626 |
hex | bf2127f269b |
13134320314011 has 24 divisors (see below), whose sum is σ = 21319476456096. Its totient is φ = 7731238711680.
The previous prime is 13134320314009. The next prime is 13134320314019. The reversal of 13134320314011 is 11041302343131.
13134320314011 is a `hidden beast` number, since 1 + 3 + 1 + 343 + 2 + 0 + 314 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 13134320314011 - 21 = 13134320314009 is a prime.
It is a super-2 number, since 2×131343203140112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13134320314019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2440413570 + ... + 2440418951.
It is an arithmetic number, because the mean of its divisors is an integer number (888311519004).
Almost surely, 213134320314011 is an apocalyptic number.
13134320314011 is a deficient number, since it is larger than the sum of its proper divisors (8185156142085).
13134320314011 is a wasteful number, since it uses less digits than its factorization.
13134320314011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4880832563 (or 4880832560 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 13134320314011 its reverse (11041302343131), we get a palindrome (24175622657142).
The spelling of 13134320314011 in words is "thirteen trillion, one hundred thirty-four billion, three hundred twenty million, three hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •