Base | Representation |
---|---|
bin | 1100000001110000111… |
… | …1000010111011101110 |
3 | 201202100112211010100000 |
4 | 3000130033002323232 |
5 | 11341140311331210 |
6 | 234531523445130 |
7 | 20633352115506 |
oct | 3003417027356 |
9 | 652315733300 |
10 | 206632136430 |
11 | 7a6a54aa495 |
12 | 340688267a6 |
13 | 16640356065 |
14 | a002c40a06 |
15 | 5595826ac0 |
hex | 301c3c2eee |
206632136430 has 48 divisors (see below), whose sum is σ = 557141470704. Its totient is φ = 55101902400.
The previous prime is 206632136423. The next prime is 206632136461. The reversal of 206632136430 is 34631236602.
206632136430 is a `hidden beast` number, since 2 + 0 + 6 + 6 + 3 + 2 + 1 + 3 + 643 + 0 = 666.
206632136430 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2066321364302 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 42514471 + ... + 42519330.
It is an arithmetic number, because the mean of its divisors is an integer number (11607113973).
Almost surely, 2206632136430 is an apocalyptic number.
206632136430 is an abundant number, since it is smaller than the sum of its proper divisors (350509334274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206632136430 is an equidigital number, since it uses as much as digits as its factorization.
206632136430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85033823 (or 85033811 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 36.
The spelling of 206632136430 in words is "two hundred six billion, six hundred thirty-two million, one hundred thirty-six thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •