Base | Representation |
---|---|
bin | 1111000001001100001100… |
… | …0010101011001010110111 |
3 | 2011110122021011220001020110 |
4 | 3300103003002223022313 |
5 | 4131022340343402210 |
6 | 55042005310434103 |
7 | 3323014445460651 |
oct | 360230302531267 |
9 | 64418234801213 |
10 | 16513126544055 |
11 | 52971a548a789 |
12 | 1a28430802933 |
13 | 92a247cb34cb |
14 | 41134d60b6d1 |
15 | 1d982710a420 |
hex | f04c30ab2b7 |
16513126544055 has 8 divisors (see below), whose sum is σ = 26421002470512. Its totient is φ = 8807000823488.
The previous prime is 16513126544053. The next prime is 16513126544063. The reversal of 16513126544055 is 55044562131561.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16513126544055 - 21 = 16513126544053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16513126543995 and 16513126544013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16513126544053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550437551454 + ... + 550437551483.
It is an arithmetic number, because the mean of its divisors is an integer number (3302625308814).
Almost surely, 216513126544055 is an apocalyptic number.
16513126544055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16513126544055 is a deficient number, since it is larger than the sum of its proper divisors (9907875926457).
16513126544055 is a wasteful number, since it uses less digits than its factorization.
16513126544055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100875102945.
The product of its (nonzero) digits is 2160000, while the sum is 48.
The spelling of 16513126544055 in words is "sixteen trillion, five hundred thirteen billion, one hundred twenty-six million, five hundred forty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •