Base | Representation |
---|---|
bin | 11101111111000110101… |
… | …01110001101000010001 |
3 | 10122111102011112000201112 |
4 | 32333203111301220101 |
5 | 113340034144220311 |
6 | 2105152443143105 |
7 | 134303034502421 |
oct | 16774325615021 |
9 | 3574364460645 |
10 | 1030311320081 |
11 | 367a5297534a |
12 | 147821214a95 |
13 | 76208cc30b4 |
14 | 37c1dd70481 |
15 | 1bc0288828b |
hex | efe3571a11 |
1030311320081 has 2 divisors, whose sum is σ = 1030311320082. Its totient is φ = 1030311320080.
The previous prime is 1030311319969. The next prime is 1030311320083. The reversal of 1030311320081 is 1800231130301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 895074935056 + 135236385025 = 946084^2 + 367745^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030311320081 - 210 = 1030311319057 is a prime.
It is a super-2 number, since 2×10303113200812 (a number of 25 digits) contains 22 as substring.
Together with 1030311320083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1030311320083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515155660040 + 515155660041.
It is an arithmetic number, because the mean of its divisors is an integer number (515155660041).
Almost surely, 21030311320081 is an apocalyptic number.
It is an amenable number.
1030311320081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030311320081 is an equidigital number, since it uses as much as digits as its factorization.
1030311320081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 1030311320081 its reverse (1800231130301), we get a palindrome (2830542450382).
The spelling of 1030311320081 in words is "one trillion, thirty billion, three hundred eleven million, three hundred twenty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •