Base | Representation |
---|---|
bin | 100011011111101001100011… |
… | …0111111000111010010100011 |
3 | 1111221110021120211100221200002 |
4 | 1012333103012333013102203 |
5 | 311410244412341131111 |
6 | 3024004415114450215 |
7 | 122522436461210561 |
oct | 10677230677072243 |
9 | 1457407524327602 |
10 | 312213101114531 |
11 | 90531918222801 |
12 | 2b024ba7a3396b |
13 | 10529752429436 |
14 | 57152a2462a31 |
15 | 26165a4e7a63b |
hex | 11bf4c6fc74a3 |
312213101114531 has 2 divisors, whose sum is σ = 312213101114532. Its totient is φ = 312213101114530.
The previous prime is 312213101114527. The next prime is 312213101114549. The reversal of 312213101114531 is 135411101312213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312213101114531 - 22 = 312213101114527 is a prime.
It is a super-2 number, since 2×3122131011145312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312213101114494 and 312213101114503.
It is not a weakly prime, because it can be changed into another prime (312213101114591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156106550557265 + 156106550557266.
It is an arithmetic number, because the mean of its divisors is an integer number (156106550557266).
Almost surely, 2312213101114531 is an apocalyptic number.
312213101114531 is a deficient number, since it is larger than the sum of its proper divisors (1).
312213101114531 is an equidigital number, since it uses as much as digits as its factorization.
312213101114531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 29.
Adding to 312213101114531 its reverse (135411101312213), we get a palindrome (447624202426744).
The spelling of 312213101114531 in words is "three hundred twelve trillion, two hundred thirteen billion, one hundred one million, one hundred fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •