Base | Representation |
---|---|
bin | 1001011000010000010110… |
… | …1001011000010001010011 |
3 | 1100111211212200212121021122 |
4 | 2112010011221120101103 |
5 | 2322424103132223331 |
6 | 33533224350112455 |
7 | 2113016454005441 |
oct | 226040551302123 |
9 | 40454780777248 |
10 | 10312311211091 |
11 | 331647692343a |
12 | 11a67181ab72b |
13 | 59a5a6743606 |
14 | 27919333db91 |
15 | 12d3a834817b |
hex | 96105a58453 |
10312311211091 has 2 divisors, whose sum is σ = 10312311211092. Its totient is φ = 10312311211090.
The previous prime is 10312311211039. The next prime is 10312311211187. The reversal of 10312311211091 is 19011211321301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10312311211091 - 214 = 10312311194707 is a prime.
It is a super-2 number, since 2×103123112110912 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10312311211091.
It is not a weakly prime, because it can be changed into another prime (10312311211031) 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, 5156155605545 + 5156155605546.
It is an arithmetic number, because the mean of its divisors is an integer number (5156155605546).
Almost surely, 210312311211091 is an apocalyptic number.
10312311211091 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312311211091 is an equidigital number, since it uses as much as digits as its factorization.
10312311211091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
Adding to 10312311211091 its reverse (19011211321301), we get a palindrome (29323522532392).
The spelling of 10312311211091 in words is "ten trillion, three hundred twelve billion, three hundred eleven million, two hundred eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •