Base | Representation |
---|---|
bin | 101110110111100001001011… |
… | …011001101110110001010101 |
3 | 1000000211101112001001000020121 |
4 | 232313201023121232301111 |
5 | 204004124141342143010 |
6 | 2010220401043231541 |
7 | 61263030653125336 |
oct | 5667411331566125 |
9 | 1000741461030217 |
10 | 206125335506005 |
11 | 5a75029a242513 |
12 | 1b1505799785b1 |
13 | 8b026c7014886 |
14 | 38c873b5d428d |
15 | 18c6bd66083da |
hex | bb784b66ec55 |
206125335506005 has 4 divisors (see below), whose sum is σ = 247350402607212. Its totient is φ = 164900268404800.
The previous prime is 206125335505997. The next prime is 206125335506009. The reversal of 206125335506005 is 500605533521602.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 146182946896996 + 59942388609009 = 12090614^2 + 7742247^2 .
It is not a de Polignac number, because 206125335506005 - 23 = 206125335505997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206125335506009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20612533550596 + ... + 20612533550605.
It is an arithmetic number, because the mean of its divisors is an integer number (61837600651803).
Almost surely, 2206125335506005 is an apocalyptic number.
It is an amenable number.
206125335506005 is a deficient number, since it is larger than the sum of its proper divisors (41225067101207).
206125335506005 is an equidigital number, since it uses as much as digits as its factorization.
206125335506005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41225067101206.
The product of its (nonzero) digits is 810000, while the sum is 43.
The spelling of 206125335506005 in words is "two hundred six trillion, one hundred twenty-five billion, three hundred thirty-five million, five hundred six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •