Base | Representation |
---|---|
bin | 1011011110001010001011… |
… | …1010110011001100010101 |
3 | 1122122202201202001100112120 |
4 | 2313202202322303030111 |
5 | 3123121411332212320 |
6 | 42454115401410153 |
7 | 2441145612113631 |
oct | 267424272631425 |
9 | 48582652040476 |
10 | 12612757304085 |
11 | 4023049758814 |
12 | 14b852aa99959 |
13 | 7064bb365b23 |
14 | 318664293dc1 |
15 | 16d147c50440 |
hex | b78a2eb3315 |
12612757304085 has 8 divisors (see below), whose sum is σ = 20180411686560. Its totient is φ = 6726803895504.
The previous prime is 12612757304083. The next prime is 12612757304099. The reversal of 12612757304085 is 58040375721621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12612757304085 - 21 = 12612757304083 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12612757304083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 420425243455 + ... + 420425243484.
It is an arithmetic number, because the mean of its divisors is an integer number (2522551460820).
Almost surely, 212612757304085 is an apocalyptic number.
12612757304085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12612757304085 is a deficient number, since it is larger than the sum of its proper divisors (7567654382475).
12612757304085 is an equidigital number, since it uses as much as digits as its factorization.
12612757304085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840850486947.
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 12612757304085 in words is "twelve trillion, six hundred twelve billion, seven hundred fifty-seven million, three hundred four thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •