Base | Representation |
---|---|
bin | 1011111100100000100100… |
… | …0100101000111101001001 |
3 | 1201111121120100100120021021 |
4 | 2333020021010220331021 |
5 | 3210142231010434231 |
6 | 43533430102112441 |
7 | 2523624532453630 |
oct | 277101104507511 |
9 | 51447510316237 |
10 | 13134162202441 |
11 | 420419217a155 |
12 | 15815a441b721 |
13 | 743713c63717 |
14 | 3359a81c8517 |
15 | 17b9b2b10811 |
hex | bf209128f49 |
13134162202441 has 8 divisors (see below), whose sum is σ = 15034720642880. Its totient is φ = 11239666150608.
The previous prime is 13134162202439. The next prime is 13134162202459. The reversal of 13134162202441 is 14420226143131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13134162202441 - 21 = 13134162202439 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13134162202397 and 13134162202406.
It is not an unprimeable number, because it can be changed into a prime (13134162202481) 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, 1515592506 + ... + 1515601171.
It is an arithmetic number, because the mean of its divisors is an integer number (1879340080360).
Almost surely, 213134162202441 is an apocalyptic number.
It is an amenable number.
13134162202441 is a deficient number, since it is larger than the sum of its proper divisors (1900558440439).
13134162202441 is an equidigital number, since it uses as much as digits as its factorization.
13134162202441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3031194303.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 13134162202441 its reverse (14420226143131), we get a palindrome (27554388345572).
The spelling of 13134162202441 in words is "thirteen trillion, one hundred thirty-four billion, one hundred sixty-two million, two hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •