Base | Representation |
---|---|
bin | 11011111111001010011110… |
… | …01100111010100100000001 |
3 | 22001220112121021011102211101 |
4 | 31333211033030322210001 |
5 | 31031313414240420144 |
6 | 334520515002414401 |
7 | 15651254406360634 |
oct | 1577451714724401 |
9 | 261815537142741 |
10 | 61543915170049 |
11 | 1867869a737764 |
12 | 6a9b758801401 |
13 | 2845749207100 |
14 | 112aa54521c1b |
15 | 71ad724ee6d4 |
hex | 37f94f33a901 |
61543915170049 has 27 divisors (see below), whose sum is σ = 69022794138363. Its totient is φ = 54848174419584.
The previous prime is 61543915170047. The next prime is 61543915170079. The reversal of 61543915170049 is 94007151934516.
The square root of 61543915170049 is 7844993.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 59993312436225 + 1550602733824 = 7745535^2 + 1245232^2 .
It is not a de Polignac number, because 61543915170049 - 21 = 61543915170047 is a prime.
It is not an unprimeable number, because it can be changed into a prime (61543915170047) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2957551957 + ... + 2957572765.
Almost surely, 261543915170049 is an apocalyptic number.
61543915170049 is the 7844993-rd square number.
61543915170049 is the 3922497-th centered octagonal number.
It is an amenable number.
61543915170049 is a deficient number, since it is larger than the sum of its proper divisors (7478878968314).
61543915170049 is an frugal number, since it uses more digits than its factorization.
61543915170049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41702 (or 20851 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 55.
The spelling of 61543915170049 in words is "sixty-one trillion, five hundred forty-three billion, nine hundred fifteen million, one hundred seventy thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •