Base | Representation |
---|---|
bin | 1000010111010011… |
… | …1110010101011001 |
3 | 12210110211211221112 |
4 | 2011310332111121 |
5 | 14044241202122 |
6 | 1010443350105 |
7 | 106432236266 |
oct | 20564762531 |
9 | 5713754845 |
10 | 2245256537 |
11 | a52430517 |
12 | 527b22335 |
13 | 29a218984 |
14 | 17429c26d |
15 | d21ab2e2 |
hex | 85d3e559 |
2245256537 has 2 divisors, whose sum is σ = 2245256538. Its totient is φ = 2245256536.
The previous prime is 2245256509. The next prime is 2245256539. The reversal of 2245256537 is 7356525422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1718599936 + 526656601 = 41456^2 + 22949^2 .
It is a cyclic number.
It is not a de Polignac number, because 2245256537 - 210 = 2245255513 is a prime.
Together with 2245256539, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2245256494 and 2245256503.
It is not a weakly prime, because it can be changed into another prime (2245256539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1122628268 + 1122628269.
It is an arithmetic number, because the mean of its divisors is an integer number (1122628269).
Almost surely, 22245256537 is an apocalyptic number.
It is an amenable number.
2245256537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2245256537 is an equidigital number, since it uses as much as digits as its factorization.
2245256537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 504000, while the sum is 41.
The square root of 2245256537 is about 47384.1380316240. The cubic root of 2245256537 is about 1309.4492055446.
The spelling of 2245256537 in words is "two billion, two hundred forty-five million, two hundred fifty-six thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •