Base | Representation |
---|---|
bin | 101110011010000110110010… |
… | …110110001101111010100001 |
3 | 222202200011110112210120021121 |
4 | 232122012302312031322201 |
5 | 203223020240201233213 |
6 | 2002032051555452241 |
7 | 60664015616011426 |
oct | 5632066266157241 |
9 | 882604415716247 |
10 | 204104141430433 |
11 | 5a041097942aa2 |
12 | 1aa848bbbb7081 |
13 | 89b6c268a6baa |
14 | 385899c031d4d |
15 | 188e33cb4488d |
hex | b9a1b2d8dea1 |
204104141430433 has 16 divisors (see below), whose sum is σ = 213360171264000. Its totient is φ = 194879951530704.
The previous prime is 204104141430421. The next prime is 204104141430443. The reversal of 204104141430433 is 334034141401402.
It is a cyclic number.
It is not a de Polignac number, because 204104141430433 - 29 = 204104141429921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204104141430443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1113509410 + ... + 1113692692.
It is an arithmetic number, because the mean of its divisors is an integer number (13335010704000).
Almost surely, 2204104141430433 is an apocalyptic number.
204104141430433 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
204104141430433 is a deficient number, since it is larger than the sum of its proper divisors (9256029833567).
204104141430433 is a wasteful number, since it uses less digits than its factorization.
204104141430433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269868.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 204104141430433 its reverse (334034141401402), we get a palindrome (538138282831835).
The spelling of 204104141430433 in words is "two hundred four trillion, one hundred four billion, one hundred forty-one million, four hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •