Base | Representation |
---|---|
bin | 11000100100101… |
… | …01110100001101 |
3 | 112100212201102122 |
4 | 30102111310031 |
5 | 410232301131 |
6 | 32242102325 |
7 | 5052054224 |
oct | 1422256415 |
9 | 470781378 |
10 | 206134541 |
11 | a63a2a28 |
12 | 5904a9a5 |
13 | 33924602 |
14 | 1d53bcbb |
15 | 1316bd7b |
hex | c495d0d |
206134541 has 4 divisors (see below), whose sum is σ = 206448000. Its totient is φ = 205821084.
The previous prime is 206134507. The next prime is 206134547. The reversal of 206134541 is 145431602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-206134541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 206134541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206134547) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 155741 + ... + 157058.
It is an arithmetic number, because the mean of its divisors is an integer number (51612000).
Almost surely, 2206134541 is an apocalyptic number.
It is an amenable number.
206134541 is a deficient number, since it is larger than the sum of its proper divisors (313459).
206134541 is an equidigital number, since it uses as much as digits as its factorization.
206134541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313458.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 206134541 is about 14357.3862872042. The cubic root of 206134541 is about 590.7226050015.
The spelling of 206134541 in words is "two hundred six million, one hundred thirty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •