Base | Representation |
---|---|
bin | 1011111001001100101… |
… | …0010000111000001001 |
3 | 201112102021110121211110 |
4 | 2332103022100320021 |
5 | 11321433043413413 |
6 | 233511412320533 |
7 | 20522355531066 |
oct | 2762312207011 |
9 | 645367417743 |
10 | 204332404233 |
11 | 79725351671 |
12 | 33726613149 |
13 | 16364a75a89 |
14 | 9c65641c6d |
15 | 54ad9a98c3 |
hex | 2f93290e09 |
204332404233 has 8 divisors (see below), whose sum is σ = 273251643808. Its totient is φ = 135817383744.
The previous prime is 204332404223. The next prime is 204332404303. The reversal of 204332404233 is 332404233402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 204332404233 - 29 = 204332403721 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204332404233.
It is not an unprimeable number, because it can be changed into a prime (204332404223) 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 7 ways as a sum of consecutive naturals, for example, 101053591 + ... + 101055612.
It is an arithmetic number, because the mean of its divisors is an integer number (34156455476).
Almost surely, 2204332404233 is an apocalyptic number.
It is an amenable number.
204332404233 is a deficient number, since it is larger than the sum of its proper divisors (68919239575).
204332404233 is a wasteful number, since it uses less digits than its factorization.
204332404233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202109543.
The product of its (nonzero) digits is 41472, while the sum is 30.
Adding to 204332404233 its reverse (332404233402), we get a palindrome (536736637635).
The spelling of 204332404233 in words is "two hundred four billion, three hundred thirty-two million, four hundred four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •