Base | Representation |
---|---|
bin | 100011011111001000001011… |
… | …1010000100001100110101011 |
3 | 1111221012102121011221110000111 |
4 | 1012332100113100201212223 |
5 | 311403111123423141021 |
6 | 3023511443411115151 |
7 | 122514321463613500 |
oct | 10676202720414653 |
9 | 1457172534843014 |
10 | 312141433412011 |
11 | 90504490718095 |
12 | 2b0131265a2ab7 |
13 | 10522a70633178 |
14 | 5711a241714a7 |
15 | 26147ad2458e1 |
hex | 11be4174219ab |
312141433412011 has 12 divisors (see below), whose sum is σ = 382214000097480. Its totient is φ = 253468231642080.
The previous prime is 312141433411979. The next prime is 312141433412059. The reversal of 312141433412011 is 110214334141213.
It is not a de Polignac number, because 312141433412011 - 25 = 312141433411979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (312141433412311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 167637718410 + ... + 167637720271.
It is an arithmetic number, because the mean of its divisors is an integer number (31851166674790).
Almost surely, 2312141433412011 is an apocalyptic number.
312141433412011 is a deficient number, since it is larger than the sum of its proper divisors (70072566685469).
312141433412011 is a wasteful number, since it uses less digits than its factorization.
312141433412011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335275438714 (or 335275438707 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 312141433412011 its reverse (110214334141213), we get a palindrome (422355767553224).
The spelling of 312141433412011 in words is "three hundred twelve trillion, one hundred forty-one billion, four hundred thirty-three million, four hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •