Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …10101011010100101001 |
3 | 10122111101101021000202012 |
4 | 32333202222223110221 |
5 | 113340023301201212 |
6 | 2105151401045305 |
7 | 134302536455525 |
oct | 16774252532451 |
9 | 3574341230665 |
10 | 1030300022057 |
11 | 367a47558a39 |
12 | 147819486835 |
13 | 76206868787 |
14 | 37c1c66cd85 |
15 | 1bc018a5922 |
hex | efe2aab529 |
1030300022057 has 2 divisors, whose sum is σ = 1030300022058. Its totient is φ = 1030300022056.
The previous prime is 1030300022051. The next prime is 1030300022077. The reversal of 1030300022057 is 7502200030301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 905534947216 + 124765074841 = 951596^2 + 353221^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030300022057 - 220 = 1030298973481 is a prime.
It is a super-2 number, since 2×10303000220572 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030300022051) 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, 515150011028 + 515150011029.
It is an arithmetic number, because the mean of its divisors is an integer number (515150011029).
Almost surely, 21030300022057 is an apocalyptic number.
It is an amenable number.
1030300022057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030300022057 is an equidigital number, since it uses as much as digits as its factorization.
1030300022057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 23.
Adding to 1030300022057 its reverse (7502200030301), we get a palindrome (8532500052358).
The spelling of 1030300022057 in words is "one trillion, thirty billion, three hundred million, twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •