Base | Representation |
---|---|
bin | 11000100101011… |
… | …00010000000000 |
3 | 112101001101111000 |
4 | 30102230100000 |
5 | 410243221212 |
6 | 32244052000 |
7 | 5052616146 |
oct | 1422542000 |
9 | 471041430 |
10 | 206226432 |
11 | a6455a75 |
12 | 59094000 |
13 | 33957399 |
14 | 1d563596 |
15 | 131891dc |
hex | c4ac400 |
206226432 has 88 divisors (see below), whose sum is σ = 610824800. Its totient is φ = 68732928.
The previous prime is 206226431. The next prime is 206226443. The reversal of 206226432 is 234622602.
206226432 is a `hidden beast` number, since 2 + 0 + 6 + 226 + 432 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 206226396 and 206226405.
It is not an unprimeable number, because it can be changed into a prime (206226431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23919 + ... + 31377.
Almost surely, 2206226432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206226432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305412400).
206226432 is an abundant number, since it is smaller than the sum of its proper divisors (404598368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206226432 is an equidigital number, since it uses as much as digits as its factorization.
206226432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7488 (or 7464 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 206226432 is about 14360.5860604642. The cubic root of 206226432 is about 590.8103697313.
The spelling of 206226432 in words is "two hundred six million, two hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •