Base | Representation |
---|---|
bin | 1011101101100110110… |
… | …1101100110000111011 |
3 | 201020101110001120202110 |
4 | 2323121231230300323 |
5 | 11244100102200243 |
6 | 232234551103403 |
7 | 20352306252432 |
oct | 2733155546073 |
9 | 636343046673 |
10 | 201221131323 |
11 | 783790a0243 |
12 | 32bb8671b63 |
13 | 15c8a3019a4 |
14 | 9a4c352119 |
15 | 537a785e33 |
hex | 2ed9b6cc3b |
201221131323 has 4 divisors (see below), whose sum is σ = 268294841768. Its totient is φ = 134147420880.
The previous prime is 201221131313. The next prime is 201221131337. The reversal of 201221131323 is 323131122102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201221131323 - 236 = 132501654587 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201221131323.
It is not an unprimeable number, because it can be changed into a prime (201221131303) 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 3 ways as a sum of consecutive naturals, for example, 33536855218 + ... + 33536855223.
It is an arithmetic number, because the mean of its divisors is an integer number (67073710442).
Almost surely, 2201221131323 is an apocalyptic number.
201221131323 is a deficient number, since it is larger than the sum of its proper divisors (67073710445).
201221131323 is an equidigital number, since it uses as much as digits as its factorization.
201221131323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67073710444.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201221131323 its reverse (323131122102), we get a palindrome (524352253425).
The spelling of 201221131323 in words is "two hundred one billion, two hundred twenty-one million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •