Base | Representation |
---|---|
bin | 1011110001000010011111… |
… | …1110010101111001100101 |
3 | 1200210202221120220201112020 |
4 | 2330100213332111321211 |
5 | 3143430201202241410 |
6 | 43303121031413353 |
7 | 2503450461604650 |
oct | 274204776257145 |
9 | 50722846821466 |
10 | 12937112149605 |
11 | 41386645a1a16 |
12 | 154b370824259 |
13 | 72ac6cb52617 |
14 | 32a233c00897 |
15 | 1767cd644a70 |
hex | bc427f95e65 |
12937112149605 has 16 divisors (see below), whose sum is σ = 23656433645184. Its totient is φ = 5914108411200.
The previous prime is 12937112149601. The next prime is 12937112149627. The reversal of 12937112149605 is 50694121173921.
It is not a de Polignac number, because 12937112149605 - 22 = 12937112149601 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12937112149601) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61605295846 + ... + 61605296055.
It is an arithmetic number, because the mean of its divisors is an integer number (1478527102824).
Almost surely, 212937112149605 is an apocalyptic number.
12937112149605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12937112149605 is a deficient number, since it is larger than the sum of its proper divisors (10719321495579).
12937112149605 is a wasteful number, since it uses less digits than its factorization.
12937112149605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123210591916.
The product of its (nonzero) digits is 816480, while the sum is 51.
The spelling of 12937112149605 in words is "twelve trillion, nine hundred thirty-seven billion, one hundred twelve million, one hundred forty-nine thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •