Base | Representation |
---|---|
bin | 11000011110011… |
… | …01010010000000 |
3 | 112022022222200211 |
4 | 30033031102000 |
5 | 410030010102 |
6 | 32212323504 |
7 | 5042063422 |
oct | 1417152200 |
9 | 468288624 |
10 | 205313152 |
11 | a59918a0 |
12 | 58913594 |
13 | 336c7795 |
14 | 1d3a6812 |
15 | 130587d7 |
hex | c3cd480 |
205313152 has 32 divisors (see below), whose sum is σ = 446209200. Its totient is φ = 93323520.
The previous prime is 205313137. The next prime is 205313167. The reversal of 205313152 is 251313502.
It is an interprime number because it is at equal distance from previous prime (205313137) and next prime (205313167).
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (22).
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 3 ways as a sum of consecutive naturals, for example, 71502 + ... + 74317.
Almost surely, 2205313152 is an apocalyptic number.
205313152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
205313152 is an abundant number, since it is smaller than the sum of its proper divisors (240896048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205313152 is a wasteful number, since it uses less digits than its factorization.
205313152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145844 (or 145832 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 205313152 is about 14328.7526323822. The cubic root of 205313152 is about 589.9369385822.
Adding to 205313152 its reverse (251313502), we get a palindrome (456626654).
The spelling of 205313152 in words is "two hundred five million, three hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •