Base | Representation |
---|---|
bin | 1011101101111110101… |
… | …0110010110111111101 |
3 | 201020122102001010101110 |
4 | 2323133222302313331 |
5 | 11244301141030323 |
6 | 232252520232233 |
7 | 20354631355536 |
oct | 2733752626775 |
9 | 636572033343 |
10 | 201321033213 |
11 | 7841a524a93 |
12 | 3302600b679 |
13 | 15ca4c0c931 |
14 | 9a5b71968d |
15 | 538441b793 |
hex | 2edfab2dfd |
201321033213 has 4 divisors (see below), whose sum is σ = 268428044288. Its totient is φ = 134214022140.
The previous prime is 201321033191. The next prime is 201321033253. The reversal of 201321033213 is 312330123102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 201321033213 - 210 = 201321032189 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 201321033213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201321033253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33553505533 + ... + 33553505538.
It is an arithmetic number, because the mean of its divisors is an integer number (67107011072).
Almost surely, 2201321033213 is an apocalyptic number.
It is an amenable number.
201321033213 is a deficient number, since it is larger than the sum of its proper divisors (67107011075).
201321033213 is an equidigital number, since it uses as much as digits as its factorization.
201321033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67107011074.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 201321033213 its reverse (312330123102), we get a palindrome (513651156315).
The spelling of 201321033213 in words is "two hundred one billion, three hundred twenty-one million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •