Base | Representation |
---|---|
bin | 1010111011111000101010… |
… | …0010001011101011001001 |
3 | 1120120110212220001010211001 |
4 | 2232332022202023223021 |
5 | 3034000011021144100 |
6 | 41323415401335001 |
7 | 2350462245635200 |
oct | 256761242135311 |
9 | 46513786033731 |
10 | 12023937678025 |
11 | 39163613a0689 |
12 | 14223a0497461 |
13 | 692b10b08100 |
14 | 2d7d66c34237 |
15 | 15cb84700d6a |
hex | aef8a88bac9 |
12023937678025 has 81 divisors (see below), whose sum is σ = 18783155450943. Its totient is φ = 7609757500800.
The previous prime is 12023937678007. The next prime is 12023937678031. The reversal of 12023937678025 is 52087673932021.
The square root of 12023937678025 is 3467555.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 7117482315321 + 4906455362704 = 2667861^2 + 2215052^2 .
It is not a de Polignac number, because 12023937678025 - 217 = 12023937546953 is a prime.
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 80 ways as a sum of consecutive naturals, for example, 1577733715 + ... + 1577741335.
Almost surely, 212023937678025 is an apocalyptic number.
12023937678025 is the 3467555-th square number.
12023937678025 is the 1733778-th centered octagonal number.
It is an amenable number.
12023937678025 is a deficient number, since it is larger than the sum of its proper divisors (6759217772918).
12023937678025 is an frugal number, since it uses more digits than its factorization.
12023937678025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15292 (or 7646 counting only the distinct ones).
The product of its (nonzero) digits is 7620480, while the sum is 55.
The spelling of 12023937678025 in words is "twelve trillion, twenty-three billion, nine hundred thirty-seven million, six hundred seventy-eight thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •