Base | Representation |
---|---|
bin | 1100000110001011111001… |
… | …1100111101011101101001 |
3 | 1202002111200201110111200021 |
4 | 3001202332130331131221 |
5 | 3220403221441324431 |
6 | 44142043103240441 |
7 | 2541631441512640 |
oct | 301427634753551 |
9 | 52074621414607 |
10 | 13300414011241 |
11 | 4268745a71845 |
12 | 15a98618a9121 |
13 | 7562ba4c2b96 |
14 | 33da5a138357 |
15 | 180e93375b11 |
hex | c18be73d769 |
13300414011241 has 8 divisors (see below), whose sum is σ = 15200785842944. Its totient is φ = 11400120351360.
The previous prime is 13300414011239. The next prime is 13300414011259. The reversal of 13300414011241 is 14211041400331.
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 13300414011241 - 21 = 13300414011239 is a prime.
It is a super-3 number, since 3×133004140112413 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13300414011211) 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, 19177905 + ... + 19859326.
It is an arithmetic number, because the mean of its divisors is an integer number (1900098230368).
Almost surely, 213300414011241 is an apocalyptic number.
It is an amenable number.
13300414011241 is a deficient number, since it is larger than the sum of its proper divisors (1900371831703).
13300414011241 is an equidigital number, since it uses as much as digits as its factorization.
13300414011241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39085911.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 13300414011241 its reverse (14211041400331), we get a palindrome (27511455411572).
The spelling of 13300414011241 in words is "thirteen trillion, three hundred billion, four hundred fourteen million, eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •