Base | Representation |
---|---|
bin | 1011100001101110110010… |
… | …1010011101011100101101 |
3 | 1122212122010111110102001010 |
4 | 2320123230222131130231 |
5 | 3130123101230424340 |
6 | 42542225012335433 |
7 | 2445450416064600 |
oct | 270335452353455 |
9 | 48778114412033 |
10 | 12674124076845 |
11 | 404707a69a440 |
12 | 15083b6614579 |
13 | 70c21b00989a |
14 | 31b60648a337 |
15 | 16ea3a482b80 |
hex | b86eca9d72d |
12674124076845 has 96 divisors (see below), whose sum is σ = 25786729783296. Its totient is φ = 5256351273600.
The previous prime is 12674124076837. The next prime is 12674124076871. The reversal of 12674124076845 is 54867042147621.
It is not a de Polignac number, because 12674124076845 - 23 = 12674124076837 is a prime.
It is a super-2 number, since 2×126741240768452 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2327940 + ... + 5546850.
It is an arithmetic number, because the mean of its divisors is an integer number (268611768576).
Almost surely, 212674124076845 is an apocalyptic number.
12674124076845 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12674124076845 is an abundant number, since it is smaller than the sum of its proper divisors (13112605706451).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12674124076845 is a wasteful number, since it uses less digits than its factorization.
12674124076845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3219431 (or 3219424 counting only the distinct ones).
The product of its (nonzero) digits is 18063360, while the sum is 57.
The spelling of 12674124076845 in words is "twelve trillion, six hundred seventy-four billion, one hundred twenty-four million, seventy-six thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •