Base | Representation |
---|---|
bin | 10100100001101010100000… |
… | …00111110110000001111101 |
3 | 12220211001212222101211212102 |
4 | 22100311100013312001331 |
5 | 21404011343310003021 |
6 | 235555420100114445 |
7 | 12336023535525101 |
oct | 1220652007660175 |
9 | 186731788354772 |
10 | 45137155547261 |
11 | 13422618646288 |
12 | 508ba72095a25 |
13 | 1c25552b2b28b |
14 | b209157b7901 |
15 | 5341c359400b |
hex | 290d501f607d |
45137155547261 has 2 divisors, whose sum is σ = 45137155547262. Its totient is φ = 45137155547260.
The previous prime is 45137155547207. The next prime is 45137155547279. The reversal of 45137155547261 is 16274555173154.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33504069592900 + 11633085954361 = 5788270^2 + 3410731^2 .
It is a cyclic number.
It is not a de Polignac number, because 45137155547261 - 222 = 45137151352957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 45137155547197 and 45137155547206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45137155547161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22568577773630 + 22568577773631.
It is an arithmetic number, because the mean of its divisors is an integer number (22568577773631).
Almost surely, 245137155547261 is an apocalyptic number.
It is an amenable number.
45137155547261 is a deficient number, since it is larger than the sum of its proper divisors (1).
45137155547261 is an equidigital number, since it uses as much as digits as its factorization.
45137155547261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17640000, while the sum is 56.
The spelling of 45137155547261 in words is "forty-five trillion, one hundred thirty-seven billion, one hundred fifty-five million, five hundred forty-seven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •