Base | Representation |
---|---|
bin | 11000101011111… |
… | …01100111111101 |
3 | 112102122221212212 |
4 | 30111331213331 |
5 | 411003142104 |
6 | 32314310205 |
7 | 5063120345 |
oct | 1425754775 |
9 | 472587785 |
10 | 207084029 |
11 | a6991329 |
12 | 59428365 |
13 | 33b97839 |
14 | 1d707d25 |
15 | 132a836e |
hex | c57d9fd |
207084029 has 4 divisors (see below), whose sum is σ = 207397980. Its totient is φ = 206770080.
The previous prime is 207084023. The next prime is 207084047. The reversal of 207084029 is 920480702.
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 127464100 + 79619929 = 11290^2 + 8923^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-207084029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 207083986 and 207084004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (207084023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 155984 + ... + 157305.
It is an arithmetic number, because the mean of its divisors is an integer number (51849495).
Almost surely, 2207084029 is an apocalyptic number.
It is an amenable number.
207084029 is a deficient number, since it is larger than the sum of its proper divisors (313951).
207084029 is an equidigital number, since it uses as much as digits as its factorization.
207084029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313950.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 207084029 is about 14390.4144832593. The cubic root of 207084029 is about 591.6282029438.
The spelling of 207084029 in words is "two hundred seven million, eighty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •