Base | Representation |
---|---|
bin | 11101111111001000000… |
… | …00001100101101010001 |
3 | 10122111102221110000210221 |
4 | 32333210000030231101 |
5 | 113340100021103131 |
6 | 2105153521353041 |
7 | 134303231151145 |
oct | 16774400145521 |
9 | 3574387400727 |
10 | 1030322441041 |
11 | 367a59180723 |
12 | 147824a98781 |
13 | 7620b3b7c4a |
14 | 37c21627225 |
15 | 1bc03833411 |
hex | efe400cb51 |
1030322441041 has 2 divisors, whose sum is σ = 1030322441042. Its totient is φ = 1030322441040.
The previous prime is 1030322441023. The next prime is 1030322441047. The reversal of 1030322441041 is 1401442230301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1017889299025 + 12433142016 = 1008905^2 + 111504^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030322441041 - 211 = 1030322438993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1030322440997 and 1030322441015.
It is not a weakly prime, because it can be changed into another prime (1030322441047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515161220520 + 515161220521.
It is an arithmetic number, because the mean of its divisors is an integer number (515161220521).
Almost surely, 21030322441041 is an apocalyptic number.
It is an amenable number.
1030322441041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030322441041 is an equidigital number, since it uses as much as digits as its factorization.
1030322441041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1030322441041 its reverse (1401442230301), we get a palindrome (2431764671342).
The spelling of 1030322441041 in words is "one trillion, thirty billion, three hundred twenty-two million, four hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •