Base | Representation |
---|---|
bin | 1011101101100101100… |
… | …0001101111100010011 |
3 | 201020101001110111002211 |
4 | 2323121120031330103 |
5 | 11244042132000201 |
6 | 232234230252551 |
7 | 20352210346636 |
oct | 2733130157423 |
9 | 636331414084 |
10 | 201215500051 |
11 | 783759a43a5 |
12 | 32bb67b7157 |
13 | 15c890ac787 |
14 | 9a4b6c7c1d |
15 | 537a022651 |
hex | 2ed960df13 |
201215500051 has 8 divisors (see below), whose sum is σ = 208165988880. Its totient is φ = 194265812832.
The previous prime is 201215500037. The next prime is 201215500097. The reversal of 201215500051 is 150005512102.
It is a happy number.
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 201215500051 - 29 = 201215499539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201215499995 and 201215500031.
It is not an unprimeable number, because it can be changed into a prime (201215500001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 334536 + ... + 717178.
It is an arithmetic number, because the mean of its divisors is an integer number (26020748610).
Almost surely, 2201215500051 is an apocalyptic number.
201215500051 is a deficient number, since it is larger than the sum of its proper divisors (6950488829).
201215500051 is a wasteful number, since it uses less digits than its factorization.
201215500051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400805.
The product of its (nonzero) digits is 500, while the sum is 22.
The spelling of 201215500051 in words is "two hundred one billion, two hundred fifteen million, five hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •