Base | Representation |
---|---|
bin | 1100001000000101101011… |
… | …0100100000110101011001 |
3 | 1202012122001211001122210112 |
4 | 3002001122310200311121 |
5 | 3221422143130432301 |
6 | 44205050444454105 |
7 | 2544166462532135 |
oct | 302013264406531 |
9 | 52178054048715 |
10 | 13333102202201 |
11 | 428059a6664a1 |
12 | 15b4064b4a335 |
13 | 7593c9798602 |
14 | 34147b5c03c5 |
15 | 181c57ea09bb |
hex | c205ad20d59 |
13333102202201 has 8 divisors (see below), whose sum is σ = 13709777511360. Its totient is φ = 12957285903408.
The previous prime is 13333102202183. The next prime is 13333102202207. The reversal of 13333102202201 is 10220220133331.
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 13333102202201 - 26 = 13333102202137 is a prime.
It is a super-2 number, since 2×133331022022012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13333102202207) 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, 214721111 + ... + 214783196.
It is an arithmetic number, because the mean of its divisors is an integer number (1713722188920).
Almost surely, 213333102202201 is an apocalyptic number.
It is an amenable number.
13333102202201 is a deficient number, since it is larger than the sum of its proper divisors (376675309159).
13333102202201 is an equidigital number, since it uses as much as digits as its factorization.
13333102202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429505183.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13333102202201 its reverse (10220220133331), we get a palindrome (23553322335532).
The spelling of 13333102202201 in words is "thirteen trillion, three hundred thirty-three billion, one hundred two million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •