Base | Representation |
---|---|
bin | 1100000110001010111000… |
… | …1011101011000100101101 |
3 | 1202002110222200211100000221 |
4 | 3001202232023223010231 |
5 | 3220402142101402023 |
6 | 44142000032451341 |
7 | 2541621615363055 |
oct | 301425613530455 |
9 | 52073880740027 |
10 | 13300141044013 |
11 | 426861598149a |
12 | 15a97a63a9b51 |
13 | 756275a9b605 |
14 | 33da31ba0565 |
15 | 180e7940685d |
hex | c18ae2eb12d |
13300141044013 has 4 divisors (see below), whose sum is σ = 13468497259840. Its totient is φ = 13131784828188.
The previous prime is 13300141043957. The next prime is 13300141044037. The reversal of 13300141044013 is 31044014100331.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13300141044013 - 213 = 13300141035821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300141044313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84178107795 + ... + 84178107952.
It is an arithmetic number, because the mean of its divisors is an integer number (3367124314960).
Almost surely, 213300141044013 is an apocalyptic number.
It is an amenable number.
13300141044013 is a deficient number, since it is larger than the sum of its proper divisors (168356215827).
13300141044013 is an equidigital number, since it uses as much as digits as its factorization.
13300141044013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168356215826.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13300141044013 its reverse (31044014100331), we get a palindrome (44344155144344).
The spelling of 13300141044013 in words is "thirteen trillion, three hundred billion, one hundred forty-one million, forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •