Base | Representation |
---|---|
bin | 11100000000110001111101… |
… | …00010101111000000111001 |
3 | 22002002211222222212000102111 |
4 | 32000120332202233000321 |
5 | 31033221203341031324 |
6 | 335002223404532321 |
7 | 15655262203650100 |
oct | 1600307642570071 |
9 | 262084888760374 |
10 | 61599470252089 |
11 | 1869a209076100 |
12 | 6aaa481b510a1 |
13 | 284aa60b05113 |
14 | 112d604927037 |
15 | 71c5248e4794 |
hex | 38063e8af039 |
61599470252089 has 27 divisors (see below), whose sum is σ = 78763731743151. Its totient is φ = 47999116297440.
The previous prime is 61599470251997. The next prime is 61599470252101. The reversal of 61599470252089 is 98025207499516.
The square root of 61599470252089 is 7848533.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 55236363101689 + 6363107150400 = 7432117^2 + 2522520^2 .
It is not a de Polignac number, because 61599470252089 - 235 = 61565110513721 is a prime.
It is not an unprimeable number, because it can be changed into a prime (61599470252189) 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, 604286077 + ... + 604388005.
Almost surely, 261599470252089 is an apocalyptic number.
61599470252089 is the 7848533-rd square number.
61599470252089 is the 3924267-th centered octagonal number.
It is an amenable number.
61599470252089 is a deficient number, since it is larger than the sum of its proper divisors (17164261491062).
61599470252089 is an frugal number, since it uses more digits than its factorization.
61599470252089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203894 (or 101947 counting only the distinct ones).
The product of its (nonzero) digits is 97977600, while the sum is 67.
The spelling of 61599470252089 in words is "sixty-one trillion, five hundred ninety-nine billion, four hundred seventy million, two hundred fifty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •