Base | Representation |
---|---|
bin | 1001001101101101010111… |
… | …1111100110001001101001 |
3 | 1022212112012101111000012011 |
4 | 2103123111333212021221 |
5 | 2311442020003233223 |
6 | 33314101304115521 |
7 | 2063643450334363 |
oct | 223332577461151 |
9 | 38775171430164 |
10 | 10131123102313 |
11 | 3256648967584 |
12 | 1177590765ba1 |
13 | 58648c90c225 |
14 | 2704c582bd33 |
15 | 1288016a280d |
hex | 936d5fe6269 |
10131123102313 has 2 divisors, whose sum is σ = 10131123102314. Its totient is φ = 10131123102312.
The previous prime is 10131123102299. The next prime is 10131123102319. The reversal of 10131123102313 is 31320132113101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6639857011264 + 3491266091049 = 2576792^2 + 1868493^2 .
It is a cyclic number.
It is not a de Polignac number, because 10131123102313 - 25 = 10131123102281 is a prime.
It is a super-4 number, since 4×101311231023134 (a number of 53 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (10131123102319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065561551156 + 5065561551157.
It is an arithmetic number, because the mean of its divisors is an integer number (5065561551157).
Almost surely, 210131123102313 is an apocalyptic number.
It is an amenable number.
10131123102313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131123102313 is an equidigital number, since it uses as much as digits as its factorization.
10131123102313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10131123102313 its reverse (31320132113101), we get a palindrome (41451255215414).
The spelling of 10131123102313 in words is "ten trillion, one hundred thirty-one billion, one hundred twenty-three million, one hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •