Base | Representation |
---|---|
bin | 100111001101110010… |
… | …011111110111100101 |
3 | 11000200112021002011200 |
4 | 213031302133313211 |
5 | 1142213430211202 |
6 | 31202132553113 |
7 | 3020312624631 |
oct | 471562376745 |
9 | 130615232150 |
10 | 42107272677 |
11 | 16948504208 |
12 | 81b1782799 |
13 | 3c80818782 |
14 | 20763cbdc1 |
15 | 11669d8e1c |
hex | 9cdc9fde5 |
42107272677 has 12 divisors (see below), whose sum is σ = 60934047564. Its totient is φ = 28019623680.
The previous prime is 42107272663. The next prime is 42107272723. The reversal of 42107272677 is 77627270124.
It can be written as a sum of positive squares in 2 ways, for example, as 5910688161 + 36196584516 = 76881^2 + 190254^2 .
It is not a de Polignac number, because 42107272677 - 27 = 42107272549 is a prime.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42107272607) 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 11 ways as a sum of consecutive naturals, for example, 4319148 + ... + 4328885.
It is an arithmetic number, because the mean of its divisors is an integer number (5077837297).
Almost surely, 242107272677 is an apocalyptic number.
It is an amenable number.
42107272677 is a deficient number, since it is larger than the sum of its proper divisors (18826774887).
42107272677 is a wasteful number, since it uses less digits than its factorization.
42107272677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8648580 (or 8648577 counting only the distinct ones).
The product of its (nonzero) digits is 460992, while the sum is 45.
The spelling of 42107272677 in words is "forty-two billion, one hundred seven million, two hundred seventy-two thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •