Base | Representation |
---|---|
bin | 10001110000001111101… |
… | …000101000000010011001 |
3 | 11022122010012100222020021 |
4 | 101300033220220002121 |
5 | 124442111423120212 |
6 | 2332250405430441 |
7 | 154100361364225 |
oct | 21601750500231 |
9 | 4278105328207 |
10 | 1220033020057 |
11 | 43045a919615 |
12 | 17854a70b421 |
13 | 8b082a84127 |
14 | 4309ad67785 |
15 | 21b087ca307 |
hex | 11c0fa28099 |
1220033020057 has 2 divisors, whose sum is σ = 1220033020058. Its totient is φ = 1220033020056.
The previous prime is 1220033019889. The next prime is 1220033020127. The reversal of 1220033020057 is 7500203300221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 688561401616 + 531471618441 = 829796^2 + 729021^2 .
It is an emirp because it is prime and its reverse (7500203300221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1220033020057 - 227 = 1219898802329 is a prime.
It is a super-3 number, since 3×12200330200573 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1220033024057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610016510028 + 610016510029.
It is an arithmetic number, because the mean of its divisors is an integer number (610016510029).
Almost surely, 21220033020057 is an apocalyptic number.
It is an amenable number.
1220033020057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220033020057 is an equidigital number, since it uses as much as digits as its factorization.
1220033020057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2520, while the sum is 25.
Adding to 1220033020057 its reverse (7500203300221), we get a palindrome (8720236320278).
The spelling of 1220033020057 in words is "one trillion, two hundred twenty billion, thirty-three million, twenty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •