Base | Representation |
---|---|
bin | 100011100110000110101001… |
… | …0111100001001111011100011 |
3 | 1112001121002101010210010001021 |
4 | 1013030031102330021323203 |
5 | 312014313213334142011 |
6 | 3025524130224350311 |
7 | 122643513066631354 |
oct | 10714152274117343 |
9 | 1461532333703037 |
10 | 313100212412131 |
11 | 90844066445731 |
12 | 2b148b03775397 |
13 | 105922b98b1701 |
14 | 57461b9bb1d2b |
15 | 262e6c5bdc471 |
hex | 11cc352f09ee3 |
313100212412131 has 2 divisors, whose sum is σ = 313100212412132. Its totient is φ = 313100212412130.
The previous prime is 313100212412081. The next prime is 313100212412201. The reversal of 313100212412131 is 131214212001313.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 313100212412131 - 27 = 313100212412003 is a prime.
It is a super-2 number, since 2×3131002124121312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 313100212412096 and 313100212412105.
It is not a weakly prime, because it can be changed into another prime (313100212418131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156550106206065 + 156550106206066.
It is an arithmetic number, because the mean of its divisors is an integer number (156550106206066).
Almost surely, 2313100212412131 is an apocalyptic number.
313100212412131 is a deficient number, since it is larger than the sum of its proper divisors (1).
313100212412131 is an equidigital number, since it uses as much as digits as its factorization.
313100212412131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 313100212412131 its reverse (131214212001313), we get a palindrome (444314424413444).
The spelling of 313100212412131 in words is "three hundred thirteen trillion, one hundred billion, two hundred twelve million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •