Base | Representation |
---|---|
bin | 1000011011011101… |
… | …00000100100100001 |
3 | 102200101002012000102 |
4 | 10031232200210201 |
5 | 33231431410022 |
6 | 2025012032145 |
7 | 220066046663 |
oct | 41556404441 |
9 | 12611065012 |
10 | 4525263137 |
11 | 1a1243619a |
12 | a63602655 |
13 | 5716b06c5 |
14 | 30d004533 |
15 | 1b742da92 |
hex | 10dba0921 |
4525263137 has 2 divisors, whose sum is σ = 4525263138. Its totient is φ = 4525263136.
The previous prime is 4525263089. The next prime is 4525263139. The reversal of 4525263137 is 7313625254.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2928541456 + 1596721681 = 54116^2 + 39959^2 .
It is a cyclic number.
It is not a de Polignac number, because 4525263137 - 26 = 4525263073 is a prime.
Together with 4525263139, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4525263137.
It is not a weakly prime, because it can be changed into another prime (4525263139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2262631568 + 2262631569.
It is an arithmetic number, because the mean of its divisors is an integer number (2262631569).
Almost surely, 24525263137 is an apocalyptic number.
It is an amenable number.
4525263137 is a deficient number, since it is larger than the sum of its proper divisors (1).
4525263137 is an equidigital number, since it uses as much as digits as its factorization.
4525263137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 151200, while the sum is 38.
The square root of 4525263137 is about 67270.0760888525. The cubic root of 4525263137 is about 1654.0473808758.
The spelling of 4525263137 in words is "four billion, five hundred twenty-five million, two hundred sixty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •