Base | Representation |
---|---|
bin | 10111111111001… |
… | …01010000011011 |
3 | 112000121212220101 |
4 | 23333211100123 |
5 | 403002421201 |
6 | 31544440231 |
7 | 4662213430 |
oct | 1377452033 |
9 | 460555811 |
10 | 201217051 |
11 | a3644392 |
12 | 57479077 |
13 | 328c2259 |
14 | 1ca1bb87 |
15 | 129e9d01 |
hex | bfe541b |
201217051 has 8 divisors (see below), whose sum is σ = 237892320. Its totient is φ = 166524288.
The previous prime is 201217021. The next prime is 201217057. The reversal of 201217051 is 150712102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201217051 - 25 = 201217019 is a prime.
It is a super-2 number, since 2×2012170512 = 80976603226273202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201217057) 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, 495406 + ... + 495811.
It is an arithmetic number, because the mean of its divisors is an integer number (29736540).
Almost surely, 2201217051 is an apocalyptic number.
201217051 is a deficient number, since it is larger than the sum of its proper divisors (36675269).
201217051 is an equidigital number, since it uses as much as digits as its factorization.
201217051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991253.
The product of its (nonzero) digits is 140, while the sum is 19.
The square root of 201217051 is about 14185.0996119167. The cubic root of 201217051 is about 585.9873758186.
Adding to 201217051 its reverse (150712102), we get a palindrome (351929153).
It can be divided in two parts, 20121 and 7051, that added together give a palindrome (27172).
The spelling of 201217051 in words is "two hundred one million, two hundred seventeen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •