Base | Representation |
---|---|
bin | 11000011101111… |
… | …00111001010000 |
3 | 112022012120121220 |
4 | 30032330321100 |
5 | 410020333112 |
6 | 32211045040 |
7 | 5041363635 |
oct | 1416747120 |
9 | 468176556 |
10 | 205246032 |
11 | a5946422 |
12 | 588a0780 |
13 | 336a3074 |
14 | 1d38a18c |
15 | 1304398c |
hex | c3bce50 |
205246032 has 40 divisors (see below), whose sum is σ = 561410496. Its totient is φ = 64390656.
The previous prime is 205246031. The next prime is 205246061. The reversal of 205246032 is 230642502.
205246032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 205245993 and 205246011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205246031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 124948 + ... + 126579.
Almost surely, 2205246032 is an apocalyptic number.
It is an amenable number.
205246032 is an abundant number, since it is smaller than the sum of its proper divisors (356164464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205246032 is a wasteful number, since it uses less digits than its factorization.
205246032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251555 (or 251549 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 205246032 is about 14326.4102970702. The cubic root of 205246032 is about 589.8726451154.
Adding to 205246032 its reverse (230642502), we get a palindrome (435888534).
It can be divided in two parts, 2052 and 46032, that added together give a palindrome (48084).
The spelling of 205246032 in words is "two hundred five million, two hundred forty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •