Base | Representation |
---|---|
bin | 10110011011011100… |
… | …00010010101011001 |
3 | 1011002011220001021101 |
4 | 23031232002111121 |
5 | 144130040111212 |
6 | 5310503311401 |
7 | 604252430236 |
oct | 131556022531 |
9 | 34064801241 |
10 | 12041332057 |
11 | 511a021aa7 |
12 | 240074b561 |
13 | 119b8a6771 |
14 | 8232da78d |
15 | 4a71d7157 |
hex | 2cdb82559 |
12041332057 has 2 divisors, whose sum is σ = 12041332058. Its totient is φ = 12041332056.
The previous prime is 12041332049. The next prime is 12041332081. The reversal of 12041332057 is 75023314021.
12041332057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7895388736 + 4145943321 = 88856^2 + 64389^2 .
It is an emirp because it is prime and its reverse (75023314021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12041332057 - 23 = 12041332049 is a prime.
It is not a weakly prime, because it can be changed into another prime (12041332087) 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 as a sum of consecutive naturals, namely, 6020666028 + 6020666029.
It is an arithmetic number, because the mean of its divisors is an integer number (6020666029).
Almost surely, 212041332057 is an apocalyptic number.
It is an amenable number.
12041332057 is a deficient number, since it is larger than the sum of its proper divisors (1).
12041332057 is an equidigital number, since it uses as much as digits as its factorization.
12041332057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 28.
Adding to 12041332057 its reverse (75023314021), we get a palindrome (87064646078).
The spelling of 12041332057 in words is "twelve billion, forty-one million, three hundred thirty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •