Base | Representation |
---|---|
bin | 100011011110010101001110… |
… | …1111010000111101011010111 |
3 | 1111220210222012012112112211022 |
4 | 1012330222131322013223113 |
5 | 311344313040432004421 |
6 | 3023345311013031355 |
7 | 122503366264251353 |
oct | 10674523572075327 |
9 | 1456728165475738 |
10 | 312032023313111 |
11 | 90472046558452 |
12 | 2abb5a9132555b |
13 | 1051565540728a |
14 | 570a605466463 |
15 | 2611a07d237ab |
hex | 11bca9de87ad7 |
312032023313111 has 2 divisors, whose sum is σ = 312032023313112. Its totient is φ = 312032023313110.
The previous prime is 312032023313081. The next prime is 312032023313113. The reversal of 312032023313111 is 111313320230213.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 312032023313111 - 214 = 312032023296727 is a prime.
Together with 312032023313113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312032023313113) 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 as a sum of consecutive naturals, namely, 156016011656555 + 156016011656556.
It is an arithmetic number, because the mean of its divisors is an integer number (156016011656556).
Almost surely, 2312032023313111 is an apocalyptic number.
312032023313111 is a deficient number, since it is larger than the sum of its proper divisors (1).
312032023313111 is an equidigital number, since it uses as much as digits as its factorization.
312032023313111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 312032023313111 its reverse (111313320230213), we get a palindrome (423345343543324).
The spelling of 312032023313111 in words is "three hundred twelve trillion, thirty-two billion, twenty-three million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •