Base | Representation |
---|---|
bin | 1011111001001100011… |
… | …0100100000100011010 |
3 | 201112102012122100021202 |
4 | 2332103012210010122 |
5 | 11321432321344031 |
6 | 233511335434202 |
7 | 20522344351151 |
oct | 2762306440432 |
9 | 645365570252 |
10 | 204331434266 |
11 | 79724849943 |
12 | 33726225962 |
13 | 163647c642b |
14 | 9c6546c598 |
15 | 54ad8672cb |
hex | 2f931a411a |
204331434266 has 8 divisors (see below), whose sum is σ = 322628580480. Its totient is φ = 96788574108.
The previous prime is 204331434257. The next prime is 204331434277. The reversal of 204331434266 is 662434133402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2043314342663 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 5377143007 = 204331434266 / (2 + 0 + 4 + 3 + 3 + 1 + 4 + 3 + 4 + 2 + 6 + 6).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2688571466 + ... + 2688571541.
It is an arithmetic number, because the mean of its divisors is an integer number (40328572560).
Almost surely, 2204331434266 is an apocalyptic number.
204331434266 is a deficient number, since it is larger than the sum of its proper divisors (118297146214).
204331434266 is a wasteful number, since it uses less digits than its factorization.
204331434266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5377143028.
The product of its (nonzero) digits is 248832, while the sum is 38.
Adding to 204331434266 its reverse (662434133402), we get a palindrome (866765567668).
The spelling of 204331434266 in words is "two hundred four billion, three hundred thirty-one million, four hundred thirty-four thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •