Base | Representation |
---|---|
bin | 11101110011110011010010… |
… | …111010100011111011111010 |
3 | 122012012100001212111020010222 |
4 | 131303303102322203323322 |
5 | 114140443142244410020 |
6 | 1142455535250340042 |
7 | 36420613352503652 |
oct | 3563632272437372 |
9 | 565170055436128 |
10 | 131103120310010 |
11 | 38856580622322 |
12 | 128547b588a622 |
13 | 581cc81949a34 |
14 | 24535d3c29362 |
15 | 102545de55b25 |
hex | 773cd2ea3efa |
131103120310010 has 32 divisors (see below), whose sum is σ = 251544084022800. Its totient is φ = 49025217344512.
The previous prime is 131103120309989. The next prime is 131103120310049. The reversal of 131103120310010 is 10013021301131.
131103120310010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 91699641936049 + 39403478373961 = 9575993^2 + 6277219^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2587876769 + ... + 2587927428.
Almost surely, 2131103120310010 is an apocalyptic number.
131103120310010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131103120310010 is a deficient number, since it is larger than the sum of its proper divisors (120440963712790).
131103120310010 is a wasteful number, since it uses less digits than its factorization.
131103120310010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5175804370.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 131103120310010 its reverse (10013021301131), we get a palindrome (141116141611141).
The spelling of 131103120310010 in words is "one hundred thirty-one trillion, one hundred three billion, one hundred twenty million, three hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •