Base | Representation |
---|---|
bin | 10111011110000101010001… |
… | …101111000010111101000011 |
3 | 111112110221211222110211100022 |
4 | 113132011101233002331003 |
5 | 102012143302444442011 |
6 | 1003311402422044055 |
7 | 30512365215650546 |
oct | 2736052157027503 |
9 | 445427758424308 |
10 | 103222320312131 |
11 | 2a9873818a79a9 |
12 | b6b121627962b |
13 | 4579a912a72a7 |
14 | 1b6bdb630a85d |
15 | be00b1c888db |
hex | 5de151bc2f43 |
103222320312131 has 2 divisors, whose sum is σ = 103222320312132. Its totient is φ = 103222320312130.
The previous prime is 103222320312121. The next prime is 103222320312151. The reversal of 103222320312131 is 131213023222301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103222320312131 - 214 = 103222320295747 is a prime.
It is a super-2 number, since 2×1032223203121312 (a number of 29 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 103222320312131.
It is not a weakly prime, because it can be changed into another prime (103222320312121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51611160156065 + 51611160156066.
It is an arithmetic number, because the mean of its divisors is an integer number (51611160156066).
Almost surely, 2103222320312131 is an apocalyptic number.
103222320312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103222320312131 is an equidigital number, since it uses as much as digits as its factorization.
103222320312131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 103222320312131 its reverse (131213023222301), we get a palindrome (234435343534432).
The spelling of 103222320312131 in words is "one hundred three trillion, two hundred twenty-two billion, three hundred twenty million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •