Base | Representation |
---|---|
bin | 101110101011101101100100… |
… | …110000010010110100100001 |
3 | 222220221211100111210012111120 |
4 | 232223231210300102310201 |
5 | 203402331044040013124 |
6 | 2004355542141402453 |
7 | 61150306421313366 |
oct | 5653554460226441 |
9 | 886854314705446 |
10 | 205314012032289 |
11 | 5a4682022a3386 |
12 | 1b03b293269429 |
13 | 8a7404a1144c4 |
14 | 389b37343846d |
15 | 18b0a4e17cd79 |
hex | babb64c12d21 |
205314012032289 has 8 divisors (see below), whose sum is σ = 273752086449600. Its totient is φ = 136875972818256.
The previous prime is 205314012032287. The next prime is 205314012032333. The reversal of 205314012032289 is 982230210413502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 205314012032289 - 21 = 205314012032287 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 205314012032289.
It is not an unprimeable number, because it can be changed into a prime (205314012032287) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 11492487 + ... + 23296035.
It is an arithmetic number, because the mean of its divisors is an integer number (34219010806200).
Almost surely, 2205314012032289 is an apocalyptic number.
It is an amenable number.
205314012032289 is a deficient number, since it is larger than the sum of its proper divisors (68438074417311).
205314012032289 is a wasteful number, since it uses less digits than its factorization.
205314012032289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17601639.
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 205314012032289 in words is "two hundred five trillion, three hundred fourteen billion, twelve million, thirty-two thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •