Base | Representation |
---|---|
bin | 11000100111001… |
… | …10110001100001 |
3 | 112101111120022021 |
4 | 30103212301201 |
5 | 410323404040 |
6 | 32253141441 |
7 | 5054635054 |
oct | 1423466141 |
9 | 471446267 |
10 | 206466145 |
11 | a65aa086 |
12 | 5918a881 |
13 | 33a0c522 |
14 | 1d5c6a9b |
15 | 131d524a |
hex | c4e6c61 |
206466145 has 4 divisors (see below), whose sum is σ = 247759380. Its totient is φ = 165172912.
The previous prime is 206466137. The next prime is 206466163. The reversal of 206466145 is 541664602.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 47100769 + 159365376 = 6863^2 + 12624^2 .
It is a cyclic number.
It is not a de Polignac number, because 206466145 - 23 = 206466137 is a prime.
It is a super-2 number, since 2×2064661452 = 85256538062322050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 206466145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20646610 + ... + 20646619.
It is an arithmetic number, because the mean of its divisors is an integer number (61939845).
Almost surely, 2206466145 is an apocalyptic number.
It is an amenable number.
206466145 is a deficient number, since it is larger than the sum of its proper divisors (41293235).
206466145 is an equidigital number, since it uses as much as digits as its factorization.
206466145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41293234.
The product of its (nonzero) digits is 34560, while the sum is 34.
The square root of 206466145 is about 14368.9298488092. The cubic root of 206466145 is about 591.0391960208.
The spelling of 206466145 in words is "two hundred six million, four hundred sixty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •