Base | Representation |
---|---|
bin | 1001011001010110000001… |
… | …0000101011100001100001 |
3 | 1100120122010221110011220111 |
4 | 2112111200100223201201 |
5 | 2323230402400112233 |
6 | 33550000122411321 |
7 | 2114251043265106 |
oct | 226254020534141 |
9 | 40518127404814 |
10 | 10331011332193 |
11 | 33233a2628182 |
12 | 11aa276960b41 |
13 | 59c296a26426 |
14 | 27a048b36aad |
15 | 12daeede9acd |
hex | 9656042b861 |
10331011332193 has 2 divisors, whose sum is σ = 10331011332194. Its totient is φ = 10331011332192.
The previous prime is 10331011332179. The next prime is 10331011332251. The reversal of 10331011332193 is 39123311013301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8201081245009 + 2129930087184 = 2863753^2 + 1459428^2 .
It is a cyclic number.
It is not a de Polignac number, because 10331011332193 - 225 = 10330977777761 is a prime.
It is not a weakly prime, because it can be changed into another prime (10331011332793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165505666096 + 5165505666097.
It is an arithmetic number, because the mean of its divisors is an integer number (5165505666097).
Almost surely, 210331011332193 is an apocalyptic number.
It is an amenable number.
10331011332193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331011332193 is an equidigital number, since it uses as much as digits as its factorization.
10331011332193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 31.
Adding to 10331011332193 its reverse (39123311013301), we get a palindrome (49454322345494).
The spelling of 10331011332193 in words is "ten trillion, three hundred thirty-one billion, eleven million, three hundred thirty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •