Base | Representation |
---|---|
bin | 10111111101100… |
… | …10110101101000 |
3 | 112000020101121200 |
4 | 23332302311220 |
5 | 402424314121 |
6 | 31540204200 |
7 | 4660363356 |
oct | 1376626550 |
9 | 460211550 |
10 | 201010536 |
11 | a3513211 |
12 | 57399660 |
13 | 3284c25c |
14 | 1c9a67d6 |
15 | 129a8a26 |
hex | bfb2d68 |
201010536 has 96 divisors (see below), whose sum is σ = 562653000. Its totient is φ = 64788480.
The previous prime is 201010489. The next prime is 201010553. The reversal of 201010536 is 635010102.
It can be written as a sum of positive squares in 4 ways, for example, as 119902500 + 81108036 = 10950^2 + 9006^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 439620 + ... + 440076.
Almost surely, 2201010536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201010536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (281326500).
201010536 is an abundant number, since it is smaller than the sum of its proper divisors (361642464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201010536 is a wasteful number, since it uses less digits than its factorization.
201010536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659 (or 652 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 201010536 is about 14177.8184499591. The cubic root of 201010536 is about 585.7868351480.
Adding to 201010536 its reverse (635010102), we get a palindrome (836020638).
The spelling of 201010536 in words is "two hundred one million, ten thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •