Base | Representation |
---|---|
bin | 1011111010100110101101… |
… | …1101101101101001001001 |
3 | 1201101111010210121021201002 |
4 | 2332221223131231221021 |
5 | 3204123234010012131 |
6 | 43510420254504345 |
7 | 2521356136533356 |
oct | 276515335555111 |
9 | 51344123537632 |
10 | 13101453204041 |
11 | 41a1327863574 |
12 | 15771962050b5 |
13 | 7406005841b7 |
14 | 33418408762d |
15 | 17abeb2756cb |
hex | bea6b76da49 |
13101453204041 has 8 divisors (see below), whose sum is σ = 13525549593600. Its totient is φ = 12677448618720.
The previous prime is 13101453204023. The next prime is 13101453204053. The reversal of 13101453204041 is 14040235410131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13101453204041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13101453203995 and 13101453204013.
It is not an unprimeable number, because it can be changed into a prime (13101453204061) 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, 22660961 + ... + 23231918.
It is an arithmetic number, because the mean of its divisors is an integer number (1690693699200).
Almost surely, 213101453204041 is an apocalyptic number.
It is an amenable number.
13101453204041 is a deficient number, since it is larger than the sum of its proper divisors (424096389559).
13101453204041 is an equidigital number, since it uses as much as digits as its factorization.
13101453204041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45902119.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 13101453204041 its reverse (14040235410131), we get a palindrome (27141688614172).
The spelling of 13101453204041 in words is "thirteen trillion, one hundred one billion, four hundred fifty-three million, two hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •