Base | Representation |
---|---|
bin | 10001011110111001000… |
… | …101001110110101111001 |
3 | 11020212000200222220122122 |
4 | 101132321011032311321 |
5 | 124140432131011212 |
6 | 2315525505331025 |
7 | 152540560164422 |
oct | 21367105166571 |
9 | 4225020886578 |
10 | 1201401032057 |
11 | 423569620226 |
12 | 174a0a936a75 |
13 | 893a3938165 |
14 | 42210628649 |
15 | 213b7bd6272 |
hex | 117b914ed79 |
1201401032057 has 2 divisors, whose sum is σ = 1201401032058. Its totient is φ = 1201401032056.
The previous prime is 1201401031993. The next prime is 1201401032071. The reversal of 1201401032057 is 7502301041021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1195357368976 + 6043663081 = 1093324^2 + 77741^2 .
It is an emirp because it is prime and its reverse (7502301041021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201401032057 - 26 = 1201401031993 is a prime.
It is not a weakly prime, because it can be changed into another prime (1201401092057) 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, 600700516028 + 600700516029.
It is an arithmetic number, because the mean of its divisors is an integer number (600700516029).
Almost surely, 21201401032057 is an apocalyptic number.
It is an amenable number.
1201401032057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201401032057 is an equidigital number, since it uses as much as digits as its factorization.
1201401032057 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 26.
Adding to 1201401032057 its reverse (7502301041021), we get a palindrome (8703702073078).
The spelling of 1201401032057 in words is "one trillion, two hundred one billion, four hundred one million, thirty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •