Base | Representation |
---|---|
bin | 101110001010… |
… | …000111011001 |
3 | 211202202011021 |
4 | 232022013121 |
5 | 11044200212 |
6 | 1111202441 |
7 | 204564064 |
oct | 56120731 |
9 | 24682137 |
10 | 12100057 |
11 | 6914a52 |
12 | 4076421 |
13 | 26786c8 |
14 | 186d8db |
15 | 10e0307 |
hex | b8a1d9 |
12100057 has 2 divisors, whose sum is σ = 12100058. Its totient is φ = 12100056.
The previous prime is 12100003. The next prime is 12100063. The reversal of 12100057 is 75000121.
12100057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8874441 + 3225616 = 2979^2 + 1796^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100057 - 27 = 12099929 is a prime.
It is a super-2 number, since 2×121000572 = 292822758806498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12100057.
It is not a weakly prime, because it can be changed into another prime (12100087) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050028 + 6050029.
It is an arithmetic number, because the mean of its divisors is an integer number (6050029).
Almost surely, 212100057 is an apocalyptic number.
It is an amenable number.
12100057 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100057 is an equidigital number, since it uses as much as digits as its factorization.
12100057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70, while the sum is 16.
The square root of 12100057 is about 3478.5136193495. The cubic root of 12100057 is about 229.5774029589.
Adding to 12100057 its reverse (75000121), we get a palindrome (87100178).
The spelling of 12100057 in words is "twelve million, one hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •