Base | Representation |
---|---|
bin | 11000000100110… |
… | …00010011100101 |
3 | 112002000010220211 |
4 | 30002120103211 |
5 | 403144403222 |
6 | 32012255421 |
7 | 5001356533 |
oct | 1402302345 |
9 | 462003824 |
10 | 201950437 |
11 | a3aa5397 |
12 | 57771571 |
13 | 32abb000 |
14 | 1cb6d153 |
15 | 12ae2277 |
hex | c0984e5 |
201950437 has 8 divisors (see below), whose sum is σ = 218774360. Its totient is φ = 186413760.
The previous prime is 201950423. The next prime is 201950471. The reversal of 201950437 is 734059102.
It can be written as a sum of positive squares in 4 ways, for example, as 96805921 + 105144516 = 9839^2 + 10254^2 .
It is a de Polignac number, because none of the positive numbers 2k-201950437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201950399 and 201950408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201950237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43764 + ... + 48157.
It is an arithmetic number, because the mean of its divisors is an integer number (27346795).
Almost surely, 2201950437 is an apocalyptic number.
It is an amenable number.
201950437 is a deficient number, since it is larger than the sum of its proper divisors (16823923).
201950437 is an frugal number, since it uses more digits than its factorization.
201950437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91960 (or 91934 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 201950437 is about 14210.9266763290. The cubic root of 201950437 is about 586.6984386130.
The spelling of 201950437 in words is "two hundred one million, nine hundred fifty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •