Base | Representation |
---|---|
bin | 10111111111001… |
… | …00010100111001 |
3 | 112000121200200021 |
4 | 23333210110321 |
5 | 403002310431 |
6 | 31544410441 |
7 | 4662166345 |
oct | 1377442471 |
9 | 460550607 |
10 | 201213241 |
11 | a3641539 |
12 | 57476a21 |
13 | 328c05b8 |
14 | 1ca1a625 |
15 | 129e8b11 |
hex | bfe4539 |
201213241 has 8 divisors (see below), whose sum is σ = 214409160. Its totient is φ = 188168448.
The previous prime is 201213227. The next prime is 201213253. The reversal of 201213241 is 142312102.
It can be written as a sum of positive squares in 4 ways, for example, as 15681600 + 185531641 = 3960^2 + 13621^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 201213241 - 25 = 201213209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201213041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35026 + ... + 40363.
It is an arithmetic number, because the mean of its divisors is an integer number (26801145).
Almost surely, 2201213241 is an apocalyptic number.
It is an amenable number.
201213241 is a deficient number, since it is larger than the sum of its proper divisors (13195919).
201213241 is a wasteful number, since it uses less digits than its factorization.
201213241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75563.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 201213241 is about 14184.9653154317. The cubic root of 201213241 is about 585.9836772818.
Adding to 201213241 its reverse (142312102), we get a palindrome (343525343).
The spelling of 201213241 in words is "two hundred one million, two hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •