Base | Representation |
---|---|
bin | 10111011101111010110101… |
… | …100100010111101011001011 |
3 | 111112102212220201220220001220 |
4 | 113131322311210113223023 |
5 | 102012002323221130011 |
6 | 1003302310213213123 |
7 | 30511520346466203 |
oct | 2735726544275313 |
9 | 445385821826056 |
10 | 103211110333131 |
11 | 2a98264a090849 |
12 | b6ab0080311a3 |
13 | 45789c5a10518 |
14 | 1b6b6315bb403 |
15 | bdeb57a6d506 |
hex | 5ddeb5917acb |
103211110333131 has 16 divisors (see below), whose sum is σ = 141347578415904. Its totient is φ = 66941378394624.
The previous prime is 103211110333129. The next prime is 103211110333157. The reversal of 103211110333131 is 131333011112301.
It is not a de Polignac number, because 103211110333131 - 21 = 103211110333129 is a prime.
It is a super-2 number, since 2×1032111103331312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103211110333171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43055916 + ... + 45389801.
It is an arithmetic number, because the mean of its divisors is an integer number (8834223650994).
Almost surely, 2103211110333131 is an apocalyptic number.
103211110333131 is a deficient number, since it is larger than the sum of its proper divisors (38136468082773).
103211110333131 is a wasteful number, since it uses less digits than its factorization.
103211110333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88456270.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 103211110333131 its reverse (131333011112301), we get a palindrome (234544121445432).
The spelling of 103211110333131 in words is "one hundred three trillion, two hundred eleven billion, one hundred ten million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •