Base | Representation |
---|---|
bin | 11000100100101… |
… | …00000101100100 |
3 | 112100212100201101 |
4 | 30102110011210 |
5 | 410232034320 |
6 | 32242005444 |
7 | 5052024460 |
oct | 1422240544 |
9 | 470770641 |
10 | 206127460 |
11 | a6398680 |
12 | 59046884 |
13 | 33921316 |
14 | 1d5394a0 |
15 | 13169c0a |
hex | c494164 |
206127460 has 96 divisors (see below), whose sum is σ = 544174848. Its totient is φ = 63713280.
The previous prime is 206127433. The next prime is 206127461. The reversal of 206127460 is 64721602.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (206127461) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 210492 + ... + 211468.
It is an arithmetic number, because the mean of its divisors is an integer number (5668488).
Almost surely, 2206127460 is an apocalyptic number.
206127460 is a gapful number since it is divisible by the number (20) 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 206127460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272087424).
206127460 is an abundant number, since it is smaller than the sum of its proper divisors (338047388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206127460 is a wasteful number, since it uses less digits than its factorization.
206127460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1141 (or 1139 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 206127460 is about 14357.1396872775. The cubic root of 206127460 is about 590.7158408842.
The spelling of 206127460 in words is "two hundred six million, one hundred twenty-seven thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •