Base | Representation |
---|---|
bin | 1011111010110001101111… |
… | …1000111111010001000101 |
3 | 1201101202210002020211011220 |
4 | 2332230123320333101011 |
5 | 3204200314231103013 |
6 | 43512030112350553 |
7 | 2521522400601333 |
oct | 276543370772105 |
9 | 51352702224156 |
10 | 13104413144133 |
11 | 41a2606652353 |
12 | 1577881545459 |
13 | 74098288083c |
14 | 334385222b53 |
15 | 17ad21054b23 |
hex | beb1be3f445 |
13104413144133 has 8 divisors (see below), whose sum is σ = 17844307260288. Its totient is φ = 8550397228704.
The previous prime is 13104413144071. The next prime is 13104413144167. The reversal of 13104413144133 is 33144131440131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13104413144133 - 29 = 13104413143621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13104413144094 and 13104413144103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104413144033) 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, 46469550016 + ... + 46469550297.
It is an arithmetic number, because the mean of its divisors is an integer number (2230538407536).
Almost surely, 213104413144133 is an apocalyptic number.
It is an amenable number.
13104413144133 is a deficient number, since it is larger than the sum of its proper divisors (4739894116155).
13104413144133 is an equidigital number, since it uses as much as digits as its factorization.
13104413144133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92939100363.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 13104413144133 its reverse (33144131440131), we get a palindrome (46248544584264).
The spelling of 13104413144133 in words is "thirteen trillion, one hundred four billion, four hundred thirteen million, one hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •