Base | Representation |
---|---|
bin | 1001010010010100011000… |
… | …0001010011110101111011 |
3 | 1100011002121012101101020222 |
4 | 2110211012001103311323 |
5 | 2314241204333324011 |
6 | 33414315205210255 |
7 | 2102446023056561 |
oct | 224450601236573 |
9 | 40132535341228 |
10 | 10210312011131 |
11 | 3287194a47871 |
12 | 118a9b0a0098b |
13 | 590a9c9a9a1b |
14 | 274278991a31 |
15 | 12a8d8857ddb |
hex | 94946053d7b |
10210312011131 has 2 divisors, whose sum is σ = 10210312011132. Its totient is φ = 10210312011130.
The previous prime is 10210312011103. The next prime is 10210312011139. The reversal of 10210312011131 is 13111021301201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10210312011131 - 222 = 10210307816827 is a prime.
It is a super-2 number, since 2×102103120111312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10210312011139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105156005565 + 5105156005566.
It is an arithmetic number, because the mean of its divisors is an integer number (5105156005566).
Almost surely, 210210312011131 is an apocalyptic number.
10210312011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210312011131 is an equidigital number, since it uses as much as digits as its factorization.
10210312011131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10210312011131 its reverse (13111021301201), we get a palindrome (23321333312332).
The spelling of 10210312011131 in words is "ten trillion, two hundred ten billion, three hundred twelve million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •