Base | Representation |
---|---|
bin | 1001000101100001101… |
… | …01011100010111010101 |
3 | 1002211212001202002002211 |
4 | 10202300311130113111 |
5 | 20103343314221031 |
6 | 355231424433421 |
7 | 31361500666141 |
oct | 4426065342725 |
9 | 1084761662084 |
10 | 312204445141 |
11 | 1104502a75a6 |
12 | 50610778871 |
13 | 23596445a94 |
14 | 11179d7c221 |
15 | 81c3d65bb1 |
hex | 48b0d5c5d5 |
312204445141 has 2 divisors, whose sum is σ = 312204445142. Its totient is φ = 312204445140.
The previous prime is 312204445139. The next prime is 312204445169. The reversal of 312204445141 is 141544402213.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 297983882641 + 14220562500 = 545879^2 + 119250^2 .
It is a cyclic number.
It is not a de Polignac number, because 312204445141 - 21 = 312204445139 is a prime.
Together with 312204445139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312204445181) 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 as a sum of consecutive naturals, namely, 156102222570 + 156102222571.
It is an arithmetic number, because the mean of its divisors is an integer number (156102222571).
Almost surely, 2312204445141 is an apocalyptic number.
It is an amenable number.
312204445141 is a deficient number, since it is larger than the sum of its proper divisors (1).
312204445141 is an equidigital number, since it uses as much as digits as its factorization.
312204445141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 312204445141 its reverse (141544402213), we get a palindrome (453748847354).
The spelling of 312204445141 in words is "three hundred twelve billion, two hundred four million, four hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •