Base | Representation |
---|---|
bin | 1100000110001110001101… |
… | …0011010000001001001111 |
3 | 1202002120021210201221012121 |
4 | 3001203203103100021033 |
5 | 3220411003222121221 |
6 | 44142224305513411 |
7 | 2541652656313330 |
oct | 301434323201117 |
9 | 52076253657177 |
10 | 13301032223311 |
11 | 4268a32a29708 |
12 | 15a99b4942867 |
13 | 7563885c7141 |
14 | 33dab82a2287 |
15 | 180ecc78ea41 |
hex | c18e34d024f |
13301032223311 has 8 divisors (see below), whose sum is σ = 15201224866944. Its totient is φ = 11400850875480.
The previous prime is 13301032223309. The next prime is 13301032223357. The reversal of 13301032223311 is 11332223010331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13301032223311 - 21 = 13301032223309 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 (13301032221311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129265 + ... + 5159338.
It is an arithmetic number, because the mean of its divisors is an integer number (1900153108368).
Almost surely, 213301032223311 is an apocalyptic number.
13301032223311 is a deficient number, since it is larger than the sum of its proper divisors (1900192643633).
13301032223311 is an equidigital number, since it uses as much as digits as its factorization.
13301032223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5647901.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13301032223311 its reverse (11332223010331), we get a palindrome (24633255233642).
The spelling of 13301032223311 in words is "thirteen trillion, three hundred one billion, thirty-two million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •