Base | Representation |
---|---|
bin | 11000000000101… |
… | …11000111110101 |
3 | 112001000021002012 |
4 | 30000113013311 |
5 | 403030440201 |
6 | 31553054005 |
7 | 4664024054 |
oct | 1400270765 |
9 | 461007065 |
10 | 201421301 |
11 | a3773894 |
12 | 57557305 |
13 | 32964203 |
14 | 1ca7239b |
15 | 12a3a5bb |
hex | c0171f5 |
201421301 has 8 divisors (see below), whose sum is σ = 202735800. Its totient is φ = 200111040.
The previous prime is 201421279. The next prime is 201421307. The reversal of 201421301 is 103124102.
It can be written as a sum of positive squares in 4 ways, for example, as 97911025 + 103510276 = 9895^2 + 10174^2 .
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 201421301 - 26 = 201421237 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 (201421307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189311 + ... + 190371.
It is an arithmetic number, because the mean of its divisors is an integer number (25341975).
Almost surely, 2201421301 is an apocalyptic number.
It is an amenable number.
201421301 is a deficient number, since it is larger than the sum of its proper divisors (1314499).
201421301 is a wasteful number, since it uses less digits than its factorization.
201421301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2119.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 201421301 is about 14192.2972418140. The cubic root of 201421301 is about 586.1855820946.
Adding to 201421301 its reverse (103124102), we get a palindrome (304545403).
The spelling of 201421301 in words is "two hundred one million, four hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •