Base | Representation |
---|---|
bin | 11001010010101000000011… |
… | …011110010111010001111011 |
3 | 112120211120222002111220121222 |
4 | 121102220003132113101323 |
5 | 104034402314024320011 |
6 | 1032322512142222255 |
7 | 32300116610224235 |
oct | 3122500336272173 |
9 | 476746862456558 |
10 | 111231121323131 |
11 | 32494943219a47 |
12 | 1058540558498b |
13 | 4a0b085359664 |
14 | 1d678877a3255 |
15 | ccd59b6c0ddb |
hex | 652a0379747b |
111231121323131 has 2 divisors, whose sum is σ = 111231121323132. Its totient is φ = 111231121323130.
The previous prime is 111231121323089. The next prime is 111231121323149. The reversal of 111231121323131 is 131323121132111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111231121323131 - 210 = 111231121322107 is a prime.
It is a super-2 number, since 2×1112311213231312 (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 111231121323131.
It is not a weakly prime, because it can be changed into another prime (111231121323151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55615560661565 + 55615560661566.
It is an arithmetic number, because the mean of its divisors is an integer number (55615560661566).
Almost surely, 2111231121323131 is an apocalyptic number.
111231121323131 is a deficient number, since it is larger than the sum of its proper divisors (1).
111231121323131 is an equidigital number, since it uses as much as digits as its factorization.
111231121323131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 648, while the sum is 26.
Adding to 111231121323131 its reverse (131323121132111), we get a palindrome (242554242455242).
The spelling of 111231121323131 in words is "one hundred eleven trillion, two hundred thirty-one billion, one hundred twenty-one million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •