Base | Representation |
---|---|
bin | 10111011100011101110011… |
… | …101110000100010100011111 |
3 | 111112002100002022010211120221 |
4 | 113130131303232010110133 |
5 | 102003333240130044411 |
6 | 1003144350253222211 |
7 | 30501353121130261 |
oct | 2734356356042437 |
9 | 445070068124527 |
10 | 103111221331231 |
11 | 2a944250379213 |
12 | b69378b491967 |
13 | 456c4671c5539 |
14 | 1b668771b1b31 |
15 | bdc25d45c071 |
hex | 5dc773b8451f |
103111221331231 has 2 divisors, whose sum is σ = 103111221331232. Its totient is φ = 103111221331230.
The previous prime is 103111221331219. The next prime is 103111221331241. The reversal of 103111221331231 is 132133122111301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103111221331231 - 243 = 94315128309023 is a prime.
It is a super-2 number, since 2×1031112213312312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103111221331196 and 103111221331205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103111221331201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555610665615 + 51555610665616.
It is an arithmetic number, because the mean of its divisors is an integer number (51555610665616).
Almost surely, 2103111221331231 is an apocalyptic number.
103111221331231 is a deficient number, since it is larger than the sum of its proper divisors (1).
103111221331231 is an equidigital number, since it uses as much as digits as its factorization.
103111221331231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 103111221331231 its reverse (132133122111301), we get a palindrome (235244343442532).
The spelling of 103111221331231 in words is "one hundred three trillion, one hundred eleven billion, two hundred twenty-one million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •