Base | Representation |
---|---|
bin | 10111011110000101010001… |
… | …010000000110101101000111 |
3 | 111112110221211102012202000012 |
4 | 113132011101100012231013 |
5 | 102012143243410413111 |
6 | 1003311401532140435 |
7 | 30512365060006202 |
oct | 2736052120065507 |
9 | 445427742182005 |
10 | 103222312201031 |
11 | 2a987378267a11 |
12 | b6b121360771b |
13 | 4579a8c6c741a |
14 | 1b6bdb51d8939 |
15 | be00b11d548b |
hex | 5de151406b47 |
103222312201031 has 2 divisors, whose sum is σ = 103222312201032. Its totient is φ = 103222312201030.
The previous prime is 103222312200979. The next prime is 103222312201069. The reversal of 103222312201031 is 130102213222301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103222312201031 - 242 = 98824265689927 is a prime.
It is a super-2 number, since 2×1032223122010312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103222312200988 and 103222312201006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103222312201081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51611156100515 + 51611156100516.
It is an arithmetic number, because the mean of its divisors is an integer number (51611156100516).
Almost surely, 2103222312201031 is an apocalyptic number.
103222312201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103222312201031 is an equidigital number, since it uses as much as digits as its factorization.
103222312201031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 103222312201031 its reverse (130102213222301), we get a palindrome (233324525423332).
The spelling of 103222312201031 in words is "one hundred three trillion, two hundred twenty-two billion, three hundred twelve million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •