Base | Representation |
---|---|
bin | 101101110001100101111110… |
… | …110110101100101000100101 |
3 | 222101211000110000202101121122 |
4 | 231301211332312230220211 |
5 | 202341412111331130341 |
6 | 1552101105140023325 |
7 | 60255620335102304 |
oct | 5561457666545045 |
9 | 871730400671548 |
10 | 201320130333221 |
11 | 5916842a193869 |
12 | 1a6b5234391b45 |
13 | 8844539a652a3 |
14 | 379dd3690043b |
15 | 1841bea3c794b |
hex | b7197edaca25 |
201320130333221 has 8 divisors (see below), whose sum is σ = 201616183823040. Its totient is φ = 201024210418912.
The previous prime is 201320130333181. The next prime is 201320130333241. The reversal of 201320130333221 is 122333031023102.
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-201320130333221 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 (201320130333241) 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, 30377135 + ... + 36406188.
It is an arithmetic number, because the mean of its divisors is an integer number (25202022977880).
Almost surely, 2201320130333221 is an apocalyptic number.
It is an amenable number.
201320130333221 is a deficient number, since it is larger than the sum of its proper divisors (296053489819).
201320130333221 is an equidigital number, since it uses as much as digits as its factorization.
201320130333221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66787755.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 201320130333221 its reverse (122333031023102), we get a palindrome (323653161356323).
The spelling of 201320130333221 in words is "two hundred one trillion, three hundred twenty billion, one hundred thirty million, three hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •