Base | Representation |
---|---|
bin | 11000000001101… |
… | …00010000000100 |
3 | 112001020022202010 |
4 | 30000310100010 |
5 | 403043244422 |
6 | 31555414220 |
7 | 4665031650 |
oct | 1400642004 |
9 | 461208663 |
10 | 201540612 |
11 | a3845499 |
12 | 575b4370 |
13 | 329a6600 |
14 | 1caa3a60 |
15 | 12a60b0c |
hex | c034404 |
201540612 has 72 divisors (see below), whose sum is σ = 582004416. Its totient is φ = 53149824.
The previous prime is 201540601. The next prime is 201540643. The reversal of 201540612 is 216045102.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7098 + ... + 21294.
Almost surely, 2201540612 is an apocalyptic number.
It is a pronic number, being equal to 14196×14197.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201540612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (291002208).
201540612 is an abundant number, since it is smaller than the sum of its proper divisors (380463804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201540612 is a wasteful number, since it uses less digits than its factorization.
201540612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14237 (or 14222 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 201540612 is about 14196.4999911950. The cubic root of 201540612 is about 586.3013007118.
Adding to 201540612 its reverse (216045102), we get a palindrome (417585714).
The spelling of 201540612 in words is "two hundred one million, five hundred forty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •