Base | Representation |
---|---|
bin | 11000000000101… |
… | …11001011100101 |
3 | 112001000021102002 |
4 | 30000113023211 |
5 | 403030442131 |
6 | 31553055045 |
7 | 4664024546 |
oct | 1400271345 |
9 | 461007362 |
10 | 201421541 |
11 | a3773a92 |
12 | 57557485 |
13 | 32964359 |
14 | 1ca724cd |
15 | 12a3a6cb |
hex | c0172e5 |
201421541 has 4 divisors (see below), whose sum is σ = 201880800. Its totient is φ = 200962284.
The previous prime is 201421531. The next prime is 201421543. The reversal of 201421541 is 145124102.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 145124102 = 2 ⋅72562051.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201421541 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201421543) 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, 228971 + ... + 229848.
It is an arithmetic number, because the mean of its divisors is an integer number (50470200).
Almost surely, 2201421541 is an apocalyptic number.
It is an amenable number.
201421541 is a deficient number, since it is larger than the sum of its proper divisors (459259).
201421541 is an equidigital number, since it uses as much as digits as its factorization.
201421541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459258.
The product of its (nonzero) digits is 320, while the sum is 20.
The square root of 201421541 is about 14192.3056971022. The cubic root of 201421541 is about 586.1858149142.
Adding to 201421541 its reverse (145124102), we get a palindrome (346545643).
The spelling of 201421541 in words is "two hundred one million, four hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •