Base | Representation |
---|---|
bin | 11110010000010110… |
… | …00111101011011101 |
3 | 1112221000120002221212 |
4 | 33020023013223131 |
5 | 231231233311000 |
6 | 11243445234205 |
7 | 1113344301341 |
oct | 171013075335 |
9 | 45830502855 |
10 | 16243260125 |
11 | 6985995824 |
12 | 3193a02965 |
13 | 16bb2a8c31 |
14 | b013b5621 |
15 | 651047c35 |
hex | 3c82c7add |
16243260125 has 8 divisors (see below), whose sum is σ = 20271588792. Its totient is φ = 12994608000.
The previous prime is 16243260119. The next prime is 16243260139. The reversal of 16243260125 is 52106234261.
It can be written as a sum of positive squares in 4 ways, for example, as 118831801 + 16124428324 = 10901^2 + 126982^2 .
It is a de Polignac number, because none of the positive numbers 2k-16243260125 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16243260091 and 16243260100.
It is a congruent number.
It is an unprimeable number.
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, 64972916 + ... + 64973165.
It is an arithmetic number, because the mean of its divisors is an integer number (2533948599).
Almost surely, 216243260125 is an apocalyptic number.
It is an amenable number.
16243260125 is a deficient number, since it is larger than the sum of its proper divisors (4028328667).
16243260125 is an equidigital number, since it uses as much as digits as its factorization.
16243260125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129946096 (or 129946086 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 16243260125 its reverse (52106234261), we get a palindrome (68349494386).
The spelling of 16243260125 in words is "sixteen billion, two hundred forty-three million, two hundred sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •