Base | Representation |
---|---|
bin | 1100000111111010111111… |
… | …0011011100111100101001 |
3 | 1202012100122212012010000112 |
4 | 3001332233303130330221 |
5 | 3221400304123121301 |
6 | 44203454032144105 |
7 | 2544035413065056 |
oct | 301765763347451 |
9 | 52170585163015 |
10 | 13330233020201 |
11 | 427a3580265a9 |
12 | 15b35a4098035 |
13 | 759060227c96 |
14 | 34128850c02d |
15 | 181b3b14c9bb |
hex | c1fafcdcf29 |
13330233020201 has 8 divisors (see below), whose sum is σ = 13492223695104. Its totient is φ = 13169154969360.
The previous prime is 13330233020119. The next prime is 13330233020231. The reversal of 13330233020201 is 10202033203331.
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 13330233020201 - 210 = 13330233019177 is a prime.
It is a super-2 number, since 2×133302330202012 (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 (13330233020231) 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, 228126626 + ... + 228185051.
It is an arithmetic number, because the mean of its divisors is an integer number (1686527961888).
Almost surely, 213330233020201 is an apocalyptic number.
It is an amenable number.
13330233020201 is a deficient number, since it is larger than the sum of its proper divisors (161990674903).
13330233020201 is a wasteful number, since it uses less digits than its factorization.
13330233020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456312031.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 13330233020201 its reverse (10202033203331), we get a palindrome (23532266223532).
The spelling of 13330233020201 in words is "thirteen trillion, three hundred thirty billion, two hundred thirty-three million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •