Base | Representation |
---|---|
bin | 101011111100110100110… |
… | …101011000111110001101 |
3 | 101200201210022020121012101 |
4 | 223330310311120332031 |
5 | 343440432043421422 |
6 | 10231252153235101 |
7 | 431130366663166 |
oct | 53746465307615 |
9 | 11621708217171 |
10 | 3020248420237 |
11 | a6497554a584 |
12 | 409417102a91 |
13 | 18ba67816159 |
14 | a62761a676d |
15 | 5386c1d0c27 |
hex | 2bf34d58f8d |
3020248420237 has 2 divisors, whose sum is σ = 3020248420238. Its totient is φ = 3020248420236.
The previous prime is 3020248420199. The next prime is 3020248420253. The reversal of 3020248420237 is 7320248420203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2647109476036 + 373138944201 = 1626994^2 + 610851^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020248420237 - 219 = 3020247895949 is a prime.
It is a super-2 number, since 2×30202484202372 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020248420196 and 3020248420205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020248420037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510124210118 + 1510124210119.
It is an arithmetic number, because the mean of its divisors is an integer number (1510124210119).
Almost surely, 23020248420237 is an apocalyptic number.
It is an amenable number.
3020248420237 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020248420237 is an equidigital number, since it uses as much as digits as its factorization.
3020248420237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 37.
The spelling of 3020248420237 in words is "three trillion, twenty billion, two hundred forty-eight million, four hundred twenty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •