Base | Representation |
---|---|
bin | 1001000101001001110… |
… | …10000001111101010111 |
3 | 1002211100010011201112201 |
4 | 10202210322001331113 |
5 | 20102441101233421 |
6 | 355155515225331 |
7 | 31353520654150 |
oct | 4424472017527 |
9 | 1084303151481 |
10 | 312004321111 |
11 | 11035833a43a |
12 | 50575748247 |
13 | 23563b471b2 |
14 | 1115b566927 |
15 | 81b14d4b91 |
hex | 48a4e81f57 |
312004321111 has 4 divisors (see below), whose sum is σ = 356576366992. Its totient is φ = 267432275232.
The previous prime is 312004321073. The next prime is 312004321133. The reversal of 312004321111 is 111123400213.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111123400213 = 7 ⋅15874771459.
It is a cyclic number.
It is not a de Polignac number, because 312004321111 - 221 = 312002223959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312004321411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22286022930 + ... + 22286022943.
It is an arithmetic number, because the mean of its divisors is an integer number (89144091748).
Almost surely, 2312004321111 is an apocalyptic number.
312004321111 is a deficient number, since it is larger than the sum of its proper divisors (44572045881).
312004321111 is an equidigital number, since it uses as much as digits as its factorization.
312004321111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44572045880.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 312004321111 its reverse (111123400213), we get a palindrome (423127721324).
The spelling of 312004321111 in words is "three hundred twelve billion, four million, three hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •