Base | Representation |
---|---|
bin | 1011101000010100101011… |
… | …1001001100010100101101 |
3 | 1200021110110002110001022202 |
4 | 2322011022321030110231 |
5 | 3134002020240144421 |
6 | 43110234422351245 |
7 | 2456600023564046 |
oct | 272051271142455 |
9 | 50243402401282 |
10 | 12787374146861 |
11 | 4090105381226 |
12 | 152634188b525 |
13 | 719ac8956532 |
14 | 322cab16d8cd |
15 | 172967a6910b |
hex | ba14ae4c52d |
12787374146861 has 8 divisors (see below), whose sum is σ = 12831141989400. Its totient is φ = 12743607154752.
The previous prime is 12787374146843. The next prime is 12787374146863. The reversal of 12787374146861 is 16864147378721.
It can be written as a sum of positive squares in 4 ways, for example, as 3269569158025 + 9517804988836 = 1808195^2 + 3085094^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 12787374146861 - 226 = 12787307037997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12787374146863) 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, 50789915 + ... + 51041063.
It is an arithmetic number, because the mean of its divisors is an integer number (1603892748675).
Almost surely, 212787374146861 is an apocalyptic number.
It is an amenable number.
12787374146861 is a deficient number, since it is larger than the sum of its proper divisors (43767842539).
12787374146861 is a wasteful number, since it uses less digits than its factorization.
12787374146861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425215.
The product of its digits is 75866112, while the sum is 65.
The spelling of 12787374146861 in words is "twelve trillion, seven hundred eighty-seven billion, three hundred seventy-four million, one hundred forty-six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •