Base | Representation |
---|---|
bin | 101111000010000100111100… |
… | …111011010001001111010000 |
3 | 1000010101202102210212210202211 |
4 | 233002010330323101033100 |
5 | 204103021212140101340 |
6 | 2011534002211121504 |
7 | 61366326114410053 |
oct | 5702047473211720 |
9 | 1003352383783684 |
10 | 206850942112720 |
11 | 5a9aaaa02587a4 |
12 | 1b249121ba3294 |
13 | 8b55c63587ab9 |
14 | 39118d3668a9a |
15 | 18daa037585ea |
hex | bc213ced13d0 |
206850942112720 has 40 divisors (see below), whose sum is σ = 480940905910176. Its totient is φ = 82738232243328.
The previous prime is 206850942112699. The next prime is 206850942112721. The reversal of 206850942112720 is 27211249058602.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206850942112721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30401862 + ... + 36578341.
Almost surely, 2206850942112720 is an apocalyptic number.
206850942112720 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
206850942112720 is an abundant number, since it is smaller than the sum of its proper divisors (274089963797456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206850942112720 is a wasteful number, since it uses less digits than its factorization.
206850942112720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67018819 (or 67018813 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 49.
The spelling of 206850942112720 in words is "two hundred six trillion, eight hundred fifty billion, nine hundred forty-two million, one hundred twelve thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •