Base | Representation |
---|---|
bin | 1001000101111110001… |
… | …11101010110101110101 |
3 | 1002212110202201000022211 |
4 | 10202333013222311311 |
5 | 20104341142312203 |
6 | 355311305253421 |
7 | 31400441031154 |
oct | 4427707526565 |
9 | 1085422630284 |
10 | 312444104053 |
11 | 110563607914 |
12 | 50678a94271 |
13 | 23603ca75a3 |
14 | 1119db2559b |
15 | 81d9e05c6d |
hex | 48bf1ead75 |
312444104053 has 2 divisors, whose sum is σ = 312444104054. Its totient is φ = 312444104052.
The previous prime is 312444104041. The next prime is 312444104059. The reversal of 312444104053 is 350401444213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 304607959569 + 7836144484 = 551913^2 + 88522^2 .
It is an emirp because it is prime and its reverse (350401444213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312444104053 - 221 = 312442006901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312444104059) 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 as a sum of consecutive naturals, namely, 156222052026 + 156222052027.
It is an arithmetic number, because the mean of its divisors is an integer number (156222052027).
Almost surely, 2312444104053 is an apocalyptic number.
It is an amenable number.
312444104053 is a deficient number, since it is larger than the sum of its proper divisors (1).
312444104053 is an equidigital number, since it uses as much as digits as its factorization.
312444104053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 312444104053 its reverse (350401444213), we get a palindrome (662845548266).
The spelling of 312444104053 in words is "three hundred twelve billion, four hundred forty-four million, one hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •