Base | Representation |
---|---|
bin | 11000000100101… |
… | …01011011011100 |
3 | 112001222112202100 |
4 | 30002111123130 |
5 | 403144014102 |
6 | 32012125100 |
7 | 5001310266 |
oct | 1402253334 |
9 | 461875670 |
10 | 201938652 |
11 | a3a97553 |
12 | 57766790 |
13 | 32ab5836 |
14 | 1cb68b36 |
15 | 12adda1c |
hex | c0956dc |
201938652 has 18 divisors (see below), whose sum is σ = 510456128. Its totient is φ = 67312872.
The previous prime is 201938617. The next prime is 201938663. The reversal of 201938652 is 256839102.
It is a tau number, because it is divible by the number of its divisors (18).
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 5609407 = 201938652 / (2 + 0 + 1 + 9 + 3 + 8 + 6 + 5 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2804668 + ... + 2804739.
Almost surely, 2201938652 is an apocalyptic number.
It is an amenable number.
201938652 is an abundant number, since it is smaller than the sum of its proper divisors (308517476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201938652 is a wasteful number, since it uses less digits than its factorization.
201938652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5609417 (or 5609412 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 201938652 is about 14210.5120245542. The cubic root of 201938652 is about 586.6870259521.
The spelling of 201938652 in words is "two hundred one million, nine hundred thirty-eight thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •