Base | Representation |
---|---|
bin | 1110101010000001000110… |
… | …1100111001110101010101 |
3 | 2010001120200001102112001122 |
4 | 3222200101230321311111 |
5 | 4103012022123402420 |
6 | 54135045123133325 |
7 | 3252162035162603 |
oct | 352402154716525 |
9 | 63046601375048 |
10 | 16115014278485 |
11 | 5153380496191 |
12 | 1983245814245 |
13 | 8cb8407a2bb5 |
14 | 3d9d8403c873 |
15 | 1ce2c62ea725 |
hex | ea811b39d55 |
16115014278485 has 8 divisors (see below), whose sum is σ = 19382677684440. Its totient is φ = 12862237722624.
The previous prime is 16115014278449. The next prime is 16115014278509. The reversal of 16115014278485 is 58487241051161.
16115014278485 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1273959175204 + 14841055103281 = 1128698^2 + 3852409^2 .
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 16115014278485 - 228 = 16114745843029 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3721710140 + ... + 3721714469.
It is an arithmetic number, because the mean of its divisors is an integer number (2422834710555).
Almost surely, 216115014278485 is an apocalyptic number.
It is an amenable number.
16115014278485 is a deficient number, since it is larger than the sum of its proper divisors (3267663405955).
16115014278485 is an equidigital number, since it uses as much as digits as its factorization.
16115014278485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7443425047.
The product of its (nonzero) digits is 2150400, while the sum is 53.
The spelling of 16115014278485 in words is "sixteen trillion, one hundred fifteen billion, fourteen million, two hundred seventy-eight thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •