Base | Representation |
---|---|
bin | 11000011111111… |
… | …10010110101001 |
3 | 112022201012102022 |
4 | 30033332112221 |
5 | 410102423103 |
6 | 32220514225 |
7 | 5043561425 |
oct | 1417762651 |
9 | 468635368 |
10 | 205514153 |
11 | a6009909 |
12 | 589ab975 |
13 | 33768110 |
14 | 1d419b85 |
15 | 13098138 |
hex | c3fe5a9 |
205514153 has 4 divisors (see below), whose sum is σ = 221322948. Its totient is φ = 189705360.
The previous prime is 205514123. The next prime is 205514167. The reversal of 205514153 is 351415502.
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 54051904 + 151462249 = 7352^2 + 12307^2 .
It is not a de Polignac number, because 205514153 - 28 = 205513897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (205514123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7904378 + ... + 7904403.
It is an arithmetic number, because the mean of its divisors is an integer number (55330737).
Almost surely, 2205514153 is an apocalyptic number.
It is an amenable number.
205514153 is a deficient number, since it is larger than the sum of its proper divisors (15808795).
205514153 is a wasteful number, since it uses less digits than its factorization.
205514153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15808794.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 205514153 is about 14335.7648208946. The cubic root of 205514153 is about 590.1293913284.
Adding to 205514153 its reverse (351415502), we get a palindrome (556929655).
The spelling of 205514153 in words is "two hundred five million, five hundred fourteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •