Base | Representation |
---|---|
bin | 100010001111011011111… |
… | …1010111111111000110001 |
3 | 121122220012110011021012001 |
4 | 1010132313322333320301 |
5 | 1104101020132320211 |
6 | 14001535125134001 |
7 | 664000631340451 |
oct | 104366772777061 |
9 | 17586173137161 |
10 | 4706074885681 |
11 | 1554920649844 |
12 | 64009ab5a301 |
13 | 281a1c9c0990 |
14 | 123abd387d61 |
15 | 8263853dac1 |
hex | 447b7ebfe31 |
4706074885681 has 8 divisors (see below), whose sum is σ = 5068684897640. Its totient is φ = 4343551195392.
The previous prime is 4706074885643. The next prime is 4706074885691. The reversal of 4706074885681 is 1865884706074.
It can be written as a sum of positive squares in 4 ways, for example, as 2064994866081 + 2641080019600 = 1437009^2 + 1625140^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4706074885681 - 229 = 4705538014769 is a prime.
It is a super-2 number, since 2×47060748856812 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4706074885601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21467160 + ... + 21685273.
It is an arithmetic number, because the mean of its divisors is an integer number (633585612205).
Almost surely, 24706074885681 is an apocalyptic number.
It is an amenable number.
4706074885681 is a deficient number, since it is larger than the sum of its proper divisors (362610011959).
4706074885681 is a wasteful number, since it uses less digits than its factorization.
4706074885681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43160835.
The product of its (nonzero) digits is 72253440, while the sum is 64.
The spelling of 4706074885681 in words is "four trillion, seven hundred six billion, seventy-four million, eight hundred eighty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •