Base | Representation |
---|---|
bin | 101110011110100011111101… |
… | …111010110100011101101110 |
3 | 222210202102211022012202121120 |
4 | 232132203331322310131232 |
5 | 203243024340430344001 |
6 | 2002424452051041410 |
7 | 61025105604401010 |
oct | 5636437572643556 |
9 | 883672738182546 |
10 | 204410343606126 |
11 | 5a149a37aa9729 |
12 | 1ab141165a0266 |
13 | 8a09a7463ac38 |
14 | 3869728b701b0 |
15 | 18972aea75236 |
hex | b9e8fdeb476e |
204410343606126 has 16 divisors (see below), whose sum is σ = 467223642528384. Its totient is φ = 58402955316024.
The previous prime is 204410343606113. The next prime is 204410343606137. The reversal of 204410343606126 is 621606343014402.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 4866912943003 = 204410343606126 / (2 + 0 + 4 + 4 + 1 + 0 + 3 + 4 + 3 + 6 + 0 + 6 + 1 + 2 + 6).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2433456471460 + ... + 2433456471543.
It is an arithmetic number, because the mean of its divisors is an integer number (29201477658024).
Almost surely, 2204410343606126 is an apocalyptic number.
204410343606126 is an abundant number, since it is smaller than the sum of its proper divisors (262813298922258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204410343606126 is a wasteful number, since it uses less digits than its factorization.
204410343606126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4866912943015.
The product of its (nonzero) digits is 497664, while the sum is 42.
The spelling of 204410343606126 in words is "two hundred four trillion, four hundred ten billion, three hundred forty-three million, six hundred six thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •