Base | Representation |
---|---|
bin | 1001011001010110000001… |
… | …0000101011100010011011 |
3 | 1100120122010221110011222122 |
4 | 2112111200100223202123 |
5 | 2323230402400113001 |
6 | 33550000122411455 |
7 | 2114251043265221 |
oct | 226254020534233 |
9 | 40518127404878 |
10 | 10331011332251 |
11 | 33233a2628225 |
12 | 11aa276960b8b |
13 | 59c296a2646c |
14 | 27a048b36b11 |
15 | 12daeede9b1b |
hex | 9656042b89b |
10331011332251 has 2 divisors, whose sum is σ = 10331011332252. Its totient is φ = 10331011332250.
The previous prime is 10331011332193. The next prime is 10331011332253. The reversal of 10331011332251 is 15223311013301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10331011332251 - 210 = 10331011331227 is a prime.
Together with 10331011332253, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10331011332251.
It is not a weakly prime, because it can be changed into another prime (10331011332253) 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, 5165505666125 + 5165505666126.
It is an arithmetic number, because the mean of its divisors is an integer number (5165505666126).
Almost surely, 210331011332251 is an apocalyptic number.
10331011332251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331011332251 is an equidigital number, since it uses as much as digits as its factorization.
10331011332251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 10331011332251 its reverse (15223311013301), we get a palindrome (25554322345552).
The spelling of 10331011332251 in words is "ten trillion, three hundred thirty-one billion, eleven million, three hundred thirty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •