Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …10101011010011000101 |
3 | 10122111101101021000121111 |
4 | 32333202222223103011 |
5 | 113340023301200312 |
6 | 2105151401045021 |
7 | 134302536455323 |
oct | 16774252532305 |
9 | 3574341230544 |
10 | 1030300021957 |
11 | 367a47558958 |
12 | 147819486771 |
13 | 7620686870b |
14 | 37c1c66cd13 |
15 | 1bc018a58a7 |
hex | efe2aab4c5 |
1030300021957 has 2 divisors, whose sum is σ = 1030300021958. Its totient is φ = 1030300021956.
The previous prime is 1030300021939. The next prime is 1030300021973. The reversal of 1030300021957 is 7591200030301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 750092834241 + 280207187716 = 866079^2 + 529346^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030300021957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030300021987) 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, 515150010978 + 515150010979.
It is an arithmetic number, because the mean of its divisors is an integer number (515150010979).
Almost surely, 21030300021957 is an apocalyptic number.
It is an amenable number.
1030300021957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030300021957 is an equidigital number, since it uses as much as digits as its factorization.
1030300021957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 31.
The spelling of 1030300021957 in words is "one trillion, thirty billion, three hundred million, twenty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •