Base | Representation |
---|---|
bin | 101110011101011011011001… |
… | …011000110100001100010011 |
3 | 222210110222200202122112012000 |
4 | 232131123121120310030103 |
5 | 203240240244323113021 |
6 | 2002325003553405043 |
7 | 61016346611623623 |
oct | 5635333130641423 |
9 | 883428622575160 |
10 | 204332421301011 |
11 | 5a119990986563 |
12 | 1ab00baa569783 |
13 | 8a02606ab45a3 |
14 | 3865a55d16883 |
15 | 189524dbb4b26 |
hex | b9d6d9634313 |
204332421301011 has 64 divisors (see below), whose sum is σ = 306849980989440. Its totient is φ = 134366094082080.
The previous prime is 204332421301007. The next prime is 204332421301033. The reversal of 204332421301011 is 110103124233402.
204332421301011 is a `hidden beast` number, since 2 + 0 + 4 + 3 + 324 + 21 + 301 + 0 + 11 = 666.
It is not a de Polignac number, because 204332421301011 - 22 = 204332421301007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (204332421300011) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5172560086 + ... + 5172599588.
It is an arithmetic number, because the mean of its divisors is an integer number (4794530952960).
Almost surely, 2204332421301011 is an apocalyptic number.
204332421301011 is a deficient number, since it is larger than the sum of its proper divisors (102517559688429).
204332421301011 is a wasteful number, since it uses less digits than its factorization.
204332421301011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43213 (or 43207 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 204332421301011 its reverse (110103124233402), we get a palindrome (314435545534413).
The spelling of 204332421301011 in words is "two hundred four trillion, three hundred thirty-two billion, four hundred twenty-one million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •