Base | Representation |
---|---|
bin | 101110011010001101001110… |
… | …010001111001000110110011 |
3 | 222202200211021121102120122012 |
4 | 232122031032101321012303 |
5 | 203223123404243333021 |
6 | 2002035152540233135 |
7 | 60664351643632646 |
oct | 5632151621710663 |
9 | 882624247376565 |
10 | 204111044121011 |
11 | 5a04400a273655 |
12 | 1aa8610783b7ab |
13 | 89b778699bba1 |
14 | 3859054a9ba5d |
15 | 188e5e3b3b35b |
hex | b9a34e4791b3 |
204111044121011 has 8 divisors (see below), whose sum is σ = 205597166958960. Its totient is φ = 202625174112768.
The previous prime is 204111044120983. The next prime is 204111044121029. The reversal of 204111044121011 is 110121440111402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 204111044121011 - 222 = 204111039926707 is a prime.
It is a super-2 number, since 2×2041110441210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204111044121211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61586786 + ... + 64816311.
It is an arithmetic number, because the mean of its divisors is an integer number (25699645869870).
Almost surely, 2204111044121011 is an apocalyptic number.
204111044121011 is a deficient number, since it is larger than the sum of its proper divisors (1486122837949).
204111044121011 is a wasteful number, since it uses less digits than its factorization.
204111044121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126414853.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 204111044121011 its reverse (110121440111402), we get a palindrome (314232484232413).
The spelling of 204111044121011 in words is "two hundred four trillion, one hundred eleven billion, forty-four million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •