Base | Representation |
---|---|
bin | 10011011100110101100001… |
… | …10011100010010110100101 |
3 | 12121102222122200120201211110 |
4 | 21232122300303202112211 |
5 | 21101240032130234022 |
6 | 230545144540255233 |
7 | 12003123146451060 |
oct | 1156326063422645 |
9 | 177388580521743 |
10 | 42772250633637 |
11 | 126a0678459a18 |
12 | 4969670241519 |
13 | 1ab3537a92695 |
14 | a7c28bb438d7 |
15 | 4e290ec8200c |
hex | 26e6b0ce25a5 |
42772250633637 has 64 divisors (see below), whose sum is σ = 66966437159424. Its totient is φ = 23780293770240.
The previous prime is 42772250633617. The next prime is 42772250633659. The reversal of 42772250633637 is 73633605227724.
42772250633637 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42772250633637 - 28 = 42772250633381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42772250633617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 43167903 + ... + 44147619.
It is an arithmetic number, because the mean of its divisors is an integer number (1046350580616).
Almost surely, 242772250633637 is an apocalyptic number.
It is an amenable number.
42772250633637 is a deficient number, since it is larger than the sum of its proper divisors (24194186525787).
42772250633637 is a wasteful number, since it uses less digits than its factorization.
42772250633637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 980158.
The product of its (nonzero) digits is 53343360, while the sum is 57.
The spelling of 42772250633637 in words is "forty-two trillion, seven hundred seventy-two billion, two hundred fifty million, six hundred thirty-three thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •