Base | Representation |
---|---|
bin | 11000100110000… |
… | …10111000100101 |
3 | 112101020002122200 |
4 | 30103002320211 |
5 | 410304203031 |
6 | 32250045113 |
7 | 5053453350 |
oct | 1423027045 |
9 | 471202580 |
10 | 206319141 |
11 | a6509696 |
12 | 59119799 |
13 | 3398a642 |
14 | 1d589297 |
15 | 131a68e6 |
hex | c4c2e25 |
206319141 has 48 divisors (see below), whose sum is σ = 355774848. Its totient is φ = 112752000.
The previous prime is 206319109. The next prime is 206319149. The reversal of 206319141 is 141913602.
206319141 is a `hidden beast` number, since 20 + 631 + 9 + 1 + 4 + 1 = 666.
206319141 is a nontrivial binomial coefficient, being equal to C(20314, 2).
It is not a de Polignac number, because 206319141 - 25 = 206319109 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206319149) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 141466 + ... + 142916.
It is an arithmetic number, because the mean of its divisors is an integer number (7411976).
Almost surely, 2206319141 is an apocalyptic number.
206319141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
206319141 is the 20313-rd triangular number and also the 10157-th hexagonal number.
It is an amenable number.
206319141 is a deficient number, since it is larger than the sum of its proper divisors (149455707).
206319141 is a wasteful number, since it uses less digits than its factorization.
206319141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1562 (or 1559 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 206319141 is about 14363.8135952817. The cubic root of 206319141 is about 590.8988893136.
The spelling of 206319141 in words is "two hundred six million, three hundred nineteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •