Base | Representation |
---|---|
bin | 101110011000110100001101… |
… | …011001100100100001110101 |
3 | 222202100200120121221221121210 |
4 | 232120310031121210201311 |
5 | 203220042133340144300 |
6 | 2001523224504432033 |
7 | 60654426305100432 |
oct | 5630641531444165 |
9 | 882320517857553 |
10 | 204015466334325 |
11 | 5a0075230898a8 |
12 | 1aa6b692a78619 |
13 | 89ab7643cc119 |
14 | 3854589098b89 |
15 | 188bd9cc77050 |
hex | b98d0d664875 |
204015466334325 has 12 divisors (see below), whose sum is σ = 337305571006208. Its totient is φ = 108808248711600.
The previous prime is 204015466334299. The next prime is 204015466334417. The reversal of 204015466334325 is 523433664510402.
It is not a de Polignac number, because 204015466334325 - 29 = 204015466333813 is a prime.
It is a super-2 number, since 2×2040154663343252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1360103108821 + ... + 1360103108970.
Almost surely, 2204015466334325 is an apocalyptic number.
204015466334325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
204015466334325 is a deficient number, since it is larger than the sum of its proper divisors (133290104671883).
204015466334325 is a wasteful number, since it uses less digits than its factorization.
204015466334325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2720206217804 (or 2720206217799 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 48.
The spelling of 204015466334325 in words is "two hundred four trillion, fifteen billion, four hundred sixty-six million, three hundred thirty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •