Base | Representation |
---|---|
bin | 1100000111111011001111… |
… | …0111100010011010000001 |
3 | 1202012100211121111000010022 |
4 | 3001332303313202122001 |
5 | 3221400424101400001 |
6 | 44203504505343225 |
7 | 2544040201441022 |
oct | 301766367423201 |
9 | 52170747430108 |
10 | 13330301200001 |
11 | 427a392564045 |
12 | 15b3602a97b15 |
13 | 7590713aa166 |
14 | 3412935b8c49 |
15 | 181b4211911b |
hex | c1fb3de2681 |
13330301200001 has 8 divisors (see below), whose sum is σ = 13859242895904. Its totient is φ = 12811064856480.
The previous prime is 13330301199979. The next prime is 13330301200157. The reversal of 13330301200001 is 10000210303331.
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-13330301200001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13330301200201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2426335295 + ... + 2426340788.
It is an arithmetic number, because the mean of its divisors is an integer number (1732405361988).
Almost surely, 213330301200001 is an apocalyptic number.
It is an amenable number.
13330301200001 is a deficient number, since it is larger than the sum of its proper divisors (528941695903).
13330301200001 is an equidigital number, since it uses as much as digits as its factorization.
13330301200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852676191.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13330301200001 its reverse (10000210303331), we get a palindrome (23330511503332).
The spelling of 13330301200001 in words is "thirteen trillion, three hundred thirty billion, three hundred one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •