Base | Representation |
---|---|
bin | 101101011001110000010… |
… | …101111000101110101101 |
3 | 102001021100022212000012221 |
4 | 231121300111320232231 |
5 | 402104310421324402 |
6 | 10345153353155341 |
7 | 441262164166246 |
oct | 55316025705655 |
9 | 12037308760187 |
10 | 3120031042477 |
11 | aa321a203538 |
12 | 4248240bbb51 |
13 | 1982aa2958ab |
14 | ab0203ddccd |
15 | 5625c2cc337 |
hex | 2d670578bad |
3120031042477 has 2 divisors, whose sum is σ = 3120031042478. Its totient is φ = 3120031042476.
The previous prime is 3120031042417. The next prime is 3120031042511. The reversal of 3120031042477 is 7742401300213.
It is an a-pointer prime, because the next prime (3120031042511) can be obtained adding 3120031042477 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2377350761956 + 742680280521 = 1541866^2 + 861789^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120031042477 - 211 = 3120031040429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120031042417) 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, 1560015521238 + 1560015521239.
It is an arithmetic number, because the mean of its divisors is an integer number (1560015521239).
Almost surely, 23120031042477 is an apocalyptic number.
It is an amenable number.
3120031042477 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120031042477 is an equidigital number, since it uses as much as digits as its factorization.
3120031042477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28224, while the sum is 34.
The spelling of 3120031042477 in words is "three trillion, one hundred twenty billion, thirty-one million, forty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •