Base | Representation |
---|---|
bin | 10111111111010… |
… | …00111101001101 |
3 | 112000122122200122 |
4 | 23333220331031 |
5 | 403003412310 |
6 | 31545034325 |
7 | 4662305546 |
oct | 1377507515 |
9 | 460578618 |
10 | 201232205 |
11 | a3654809 |
12 | 574859a5 |
13 | 328c9115 |
14 | 1ca234cd |
15 | 129ee555 |
hex | bfe8f4d |
201232205 has 4 divisors (see below), whose sum is σ = 241478652. Its totient is φ = 160985760.
The previous prime is 201232201. The next prime is 201232219. The reversal of 201232205 is 502232102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 132043081 + 69189124 = 11491^2 + 8318^2 .
It is not a de Polignac number, because 201232205 - 22 = 201232201 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 (201232201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20123216 + ... + 20123225.
It is an arithmetic number, because the mean of its divisors is an integer number (60369663).
Almost surely, 2201232205 is an apocalyptic number.
It is an amenable number.
201232205 is a deficient number, since it is larger than the sum of its proper divisors (40246447).
201232205 is an equidigital number, since it uses as much as digits as its factorization.
201232205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40246446.
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 201232205 is about 14185.6337539075. The cubic root of 201232205 is about 586.0020860196.
Adding to 201232205 its reverse (502232102), we get a palindrome (703464307).
The spelling of 201232205 in words is "two hundred one million, two hundred thirty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •