Base | Representation |
---|---|
bin | 1011100010011010011011… |
… | …1000101110101110011000 |
3 | 1122220202100212212100000000 |
4 | 2320212212320232232120 |
5 | 3130321044102030032 |
6 | 42551443233213000 |
7 | 2446343620340625 |
oct | 270464670565630 |
9 | 48822325770000 |
10 | 12685838314392 |
11 | 40510410114a1 |
12 | 150a725701160 |
13 | 710366bb9ba9 |
14 | 31bdd815d34c |
15 | 16eec3aa7e7c |
hex | b89a6e2eb98 |
12685838314392 has 72 divisors (see below), whose sum is σ = 35677107729900. Its totient is φ = 4228612753968.
The previous prime is 12685838314309. The next prime is 12685838314427. The reversal of 12685838314392 is 29341383858621.
12685838314392 is a `hidden beast` number, since 1 + 2 + 6 + 8 + 583 + 8 + 3 + 1 + 43 + 9 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 120792642 + ... + 120897617.
Almost surely, 212685838314392 is an apocalyptic number.
12685838314392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12685838314392 is an abundant number, since it is smaller than the sum of its proper divisors (22991269415508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12685838314392 is an frugal number, since it uses more digits than its factorization.
12685838314392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241690289 (or 241690264 counting only the distinct ones).
The product of its digits is 59719680, while the sum is 63.
The spelling of 12685838314392 in words is "twelve trillion, six hundred eighty-five billion, eight hundred thirty-eight million, three hundred fourteen thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •