Base | Representation |
---|---|
bin | 10000110110110101000001… |
… | …010001100000110010100001 |
3 | 100201111101022221022211222111 |
4 | 100312311001101200302201 |
5 | 34204123101023343144 |
6 | 421401503311035321 |
7 | 21421121134114054 |
oct | 2066650121406241 |
9 | 321441287284874 |
10 | 74136525606049 |
11 | 2169313aa73275 |
12 | 83941a450bb41 |
13 | 324a076621aca |
14 | 1444326bbca9b |
15 | 8886db672534 |
hex | 436d41460ca1 |
74136525606049 has 9 divisors (see below), whose sum is σ = 77500204488273. Its totient is φ = 70913008980132.
The previous prime is 74136525606037. The next prime is 74136525606127. The reversal of 74136525606049 is 94060652563147.
The square root of 74136525606049 is 8610257.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 74136525606049 - 215 = 74136525573281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 74136525605984 and 74136525606002.
It is not an unprimeable number, because it can be changed into a prime (74136525606029) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 197848732 + ... + 198223090.
Almost surely, 274136525606049 is an apocalyptic number.
74136525606049 is the 8610257-th square number.
74136525606049 is the 4305129-th centered octagonal number.
It is an amenable number.
74136525606049 is a deficient number, since it is larger than the sum of its proper divisors (3363678882224).
74136525606049 is an frugal number, since it uses more digits than its factorization.
74136525606049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 748764 (or 374382 counting only the distinct ones).
The product of its (nonzero) digits is 32659200, while the sum is 58.
The spelling of 74136525606049 in words is "seventy-four trillion, one hundred thirty-six billion, five hundred twenty-five million, six hundred six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •