Base | Representation |
---|---|
bin | 10011010100010000111… |
… | …010101100010101100001 |
3 | 11200220022210022120212211 |
4 | 103110100322230111201 |
5 | 133222033222401443 |
6 | 2453451244122121 |
7 | 164621630626141 |
oct | 23242072542541 |
9 | 4626283276784 |
10 | 1327428715873 |
11 | 471a609a4417 |
12 | 195321236341 |
13 | 98239861c30 |
14 | 48368308921 |
15 | 247e1e4219d |
hex | 13510eac561 |
1327428715873 has 8 divisors (see below), whose sum is σ = 1443692466216. Its totient is φ = 1213186944000.
The previous prime is 1327428715771. The next prime is 1327428715901. The reversal of 1327428715873 is 3785178247231.
It can be written as a sum of positive squares in 4 ways, for example, as 133680178129 + 1193748537744 = 365623^2 + 1092588^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 1327428715873 - 213 = 1327428707681 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1327428718873) 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, 505493248 + ... + 505495873.
It is an arithmetic number, because the mean of its divisors is an integer number (180461558277).
Almost surely, 21327428715873 is an apocalyptic number.
1327428715873 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1327428715873 is a deficient number, since it is larger than the sum of its proper divisors (116263750343).
1327428715873 is a wasteful number, since it uses less digits than its factorization.
1327428715873 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1010989235.
The product of its digits is 15805440, while the sum is 58.
The spelling of 1327428715873 in words is "one trillion, three hundred twenty-seven billion, four hundred twenty-eight million, seven hundred fifteen thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •