Base | Representation |
---|---|
bin | 1011111100100010110… |
… | …0011101101001001000 |
3 | 201121201212111202110220 |
4 | 2333020230131221020 |
5 | 11330303010434424 |
6 | 234140455110040 |
7 | 20553542664336 |
oct | 2771054355110 |
9 | 647655452426 |
10 | 205230561864 |
11 | 7a0463357a9 |
12 | 33937372320 |
13 | 16478b759b3 |
14 | 9d0ca3cb56 |
15 | 5512770579 |
hex | 2fc8b1da48 |
205230561864 has 32 divisors (see below), whose sum is σ = 543257370720. Its totient is φ = 64386058496.
The previous prime is 205230561821. The next prime is 205230561869. The reversal of 205230561864 is 468165032502.
205230561864 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (205230561869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251507634 + ... + 251508449.
It is an arithmetic number, because the mean of its divisors is an integer number (16976792835).
Almost surely, 2205230561864 is an apocalyptic number.
205230561864 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
205230561864 is an abundant number, since it is smaller than the sum of its proper divisors (338026808856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205230561864 is a wasteful number, since it uses less digits than its factorization.
205230561864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503016109 (or 503016105 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 205230561864 in words is "two hundred five billion, two hundred thirty million, five hundred sixty-one thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •