Base | Representation |
---|---|
bin | 10110100110011100… |
… | …10010010001111001 |
3 | 1011022121122101221101 |
4 | 23103032102101321 |
5 | 144322210001212 |
6 | 5324002411401 |
7 | 606453340123 |
oct | 132316222171 |
9 | 34277571841 |
10 | 12133672057 |
11 | 5167161451 |
12 | 2427660b61 |
13 | 11b4a67810 |
14 | 831696213 |
15 | 4b0377157 |
hex | 2d3392479 |
12133672057 has 8 divisors (see below), whose sum is σ = 13635163584. Its totient is φ = 10713342288.
The previous prime is 12133672049. The next prime is 12133672063. The reversal of 12133672057 is 75027633121.
12133672057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12133672057 - 23 = 12133672049 is a prime.
It is a super-2 number, since 2×121336720572 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12133672027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20290123 + ... + 20290720.
It is an arithmetic number, because the mean of its divisors is an integer number (1704395448).
Almost surely, 212133672057 is an apocalyptic number.
It is an amenable number.
12133672057 is a deficient number, since it is larger than the sum of its proper divisors (1501491527).
12133672057 is a wasteful number, since it uses less digits than its factorization.
12133672057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40580879.
The product of its (nonzero) digits is 52920, while the sum is 37.
The spelling of 12133672057 in words is "twelve billion, one hundred thirty-three million, six hundred seventy-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •