Base | Representation |
---|---|
bin | 11000101000011… |
… | …00101011100000 |
3 | 112101210110021202 |
4 | 30110030223200 |
5 | 410343341113 |
6 | 32300340332 |
7 | 5056152530 |
oct | 1424145340 |
9 | 471713252 |
10 | 206621408 |
11 | a66a57a4 |
12 | 592446a8 |
13 | 33a650b6 |
14 | 1d6274c0 |
15 | 13216258 |
hex | c50cae0 |
206621408 has 48 divisors (see below), whose sum is σ = 467832960. Its totient is φ = 87993216.
The previous prime is 206621377. The next prime is 206621411. The reversal of 206621408 is 804126602.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33683 + ... + 39341.
It is an arithmetic number, because the mean of its divisors is an integer number (9746520).
Almost surely, 2206621408 is an apocalyptic number.
206621408 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206621408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233916480).
206621408 is an abundant number, since it is smaller than the sum of its proper divisors (261211552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206621408 is a wasteful number, since it uses less digits than its factorization.
206621408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5839 (or 5831 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
The square root of 206621408 is about 14374.3315670677. The cubic root of 206621408 is about 591.1873131620.
The spelling of 206621408 in words is "two hundred six million, six hundred twenty-one thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •