Base | Representation |
---|---|
bin | 10110100110010110… |
… | …11100101001111001 |
3 | 1011022120020121110012 |
4 | 23103023130221321 |
5 | 144322012144441 |
6 | 5323534431305 |
7 | 606444121166 |
oct | 132313345171 |
9 | 34276217405 |
10 | 12132928121 |
11 | 51667a3526 |
12 | 2427362535 |
13 | 11b4867012 |
14 | 83154106d |
15 | 4b027b9eb |
hex | 2d32dca79 |
12132928121 has 4 divisors (see below), whose sum is σ = 12331828644. Its totient is φ = 11934027600.
The previous prime is 12132928043. The next prime is 12132928153. The reversal of 12132928121 is 12182923121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1329404521 + 10803523600 = 36461^2 + 103940^2 .
It is a cyclic number.
It is not a de Polignac number, because 12132928121 - 210 = 12132927097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12132628121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99450170 + ... + 99450291.
It is an arithmetic number, because the mean of its divisors is an integer number (3082957161).
Almost surely, 212132928121 is an apocalyptic number.
It is an amenable number.
12132928121 is a deficient number, since it is larger than the sum of its proper divisors (198900523).
12132928121 is an equidigital number, since it uses as much as digits as its factorization.
12132928121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198900522.
The product of its digits is 3456, while the sum is 32.
Subtracting 12132928121 from its reverse (12182923121), we obtain a triangular number (49995000 = T9999).
The spelling of 12132928121 in words is "twelve billion, one hundred thirty-two million, nine hundred twenty-eight thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •