Base | Representation |
---|---|
bin | 10001011101100101110… |
… | …100011110110011011001 |
3 | 11020201102100111001002121 |
4 | 101131211310132303121 |
5 | 124130102024211212 |
6 | 2315135125101241 |
7 | 152461135552603 |
oct | 21354564366331 |
9 | 4221370431077 |
10 | 1200004132057 |
11 | 422a12059615 |
12 | 17469ab57821 |
13 | 89210403703 |
14 | 4211acc2173 |
15 | 21335254d07 |
hex | 11765d1ecd9 |
1200004132057 has 2 divisors, whose sum is σ = 1200004132058. Its totient is φ = 1200004132056.
The previous prime is 1200004132013. The next prime is 1200004132091. The reversal of 1200004132057 is 7502314000021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1154558846016 + 45445286041 = 1074504^2 + 213179^2 .
It is an emirp because it is prime and its reverse (7502314000021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1200004132057 - 227 = 1199869914329 is a prime.
It is not a weakly prime, because it can be changed into another prime (1200004132757) by changing a digit.
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 as a sum of consecutive naturals, namely, 600002066028 + 600002066029.
It is an arithmetic number, because the mean of its divisors is an integer number (600002066029).
Almost surely, 21200004132057 is an apocalyptic number.
It is an amenable number.
1200004132057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200004132057 is an equidigital number, since it uses as much as digits as its factorization.
1200004132057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
Adding to 1200004132057 its reverse (7502314000021), we get a palindrome (8702318132078).
The spelling of 1200004132057 in words is "one trillion, two hundred billion, four million, one hundred thirty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •