Base | Representation |
---|---|
bin | 11000011110101… |
… | …11100010010000 |
3 | 112022102010022101 |
4 | 30033113202100 |
5 | 410032331102 |
6 | 32213250144 |
7 | 5042330032 |
oct | 1417274220 |
9 | 468363271 |
10 | 205355152 |
11 | a5a10402 |
12 | 58933954 |
13 | 33710932 |
14 | 1d3b7c52 |
15 | 13065e87 |
hex | c3d7890 |
205355152 has 20 divisors (see below), whose sum is σ = 400180860. Its totient is φ = 102082688.
The previous prime is 205355147. The next prime is 205355159. The reversal of 205355152 is 251553502.
205355152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 134189056 + 71166096 = 11584^2 + 8436^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 205355152.
It is not an unprimeable number, because it can be changed into a prime (205355159) by changing a digit.
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, 34327 + ... + 39862.
It is an arithmetic number, because the mean of its divisors is an integer number (20009043).
Almost surely, 2205355152 is an apocalyptic number.
It is an amenable number.
205355152 is a deficient number, since it is larger than the sum of its proper divisors (194825708).
205355152 is a wasteful number, since it uses less digits than its factorization.
205355152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74370 (or 74364 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 28.
The square root of 205355152 is about 14330.2181420940. The cubic root of 205355152 is about 589.9771627663.
The spelling of 205355152 in words is "two hundred five million, three hundred fifty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •