Base | Representation |
---|---|
bin | 1100000110001111100101… |
… | …1110111111100111101111 |
3 | 1202002121020202001110210112 |
4 | 3001203321132333213233 |
5 | 3220412234011300421 |
6 | 44142325242530235 |
7 | 2541665125624022 |
oct | 301437136774757 |
9 | 52077222043715 |
10 | 13301404400111 |
11 | 4269104020643 |
12 | 15a9a9950697b |
13 | 7564177464b9 |
14 | 33db118a31b9 |
15 | 1810002a945b |
hex | c18f97bf9ef |
13301404400111 has 4 divisors (see below), whose sum is σ = 13301422959552. Its totient is φ = 13301385840672.
The previous prime is 13301404400093. The next prime is 13301404400117. The reversal of 13301404400111 is 11100440410331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13301404400111 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 (13301404400117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8159615 + ... + 9653088.
It is an arithmetic number, because the mean of its divisors is an integer number (3325355739888).
Almost surely, 213301404400111 is an apocalyptic number.
13301404400111 is a deficient number, since it is larger than the sum of its proper divisors (18559441).
13301404400111 is an equidigital number, since it uses as much as digits as its factorization.
13301404400111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18559440.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13301404400111 its reverse (11100440410331), we get a palindrome (24401844810442).
The spelling of 13301404400111 in words is "thirteen trillion, three hundred one billion, four hundred four million, four hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •