Base | Representation |
---|---|
bin | 11000010110001… |
… | …01100101010011 |
3 | 112020022010001210 |
4 | 30023011211103 |
5 | 404240424133 |
6 | 32133231203 |
7 | 5026644420 |
oct | 1413054523 |
9 | 466263053 |
10 | 204233043 |
11 | a5314343 |
12 | 58492503 |
13 | 33409c71 |
14 | 1d1a4d47 |
15 | 12de3763 |
hex | c2c5953 |
204233043 has 16 divisors (see below), whose sum is σ = 316488960. Its totient is φ = 114725856.
The previous prime is 204233039. The next prime is 204233047. The reversal of 204233043 is 340332402.
It is an interprime number because it is at equal distance from previous prime (204233039) and next prime (204233047).
It is not a de Polignac number, because 204233043 - 22 = 204233039 is a prime.
It is a super-2 number, since 2×2042330432 = 83422271706079698, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (204233047) 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 15 ways as a sum of consecutive naturals, for example, 81180 + ... + 83657.
It is an arithmetic number, because the mean of its divisors is an integer number (19780560).
Almost surely, 2204233043 is an apocalyptic number.
204233043 is a deficient number, since it is larger than the sum of its proper divisors (112255917).
204233043 is a wasteful number, since it uses less digits than its factorization.
204233043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164906.
The product of its (nonzero) digits is 1728, while the sum is 21.
The square root of 204233043 is about 14291.0126653082. The cubic root of 204233043 is about 588.9006080589.
Adding to 204233043 its reverse (340332402), we get a palindrome (544565445).
The spelling of 204233043 in words is "two hundred four million, two hundred thirty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •