Base | Representation |
---|---|
bin | 100111101110010000… |
… | …011111001010110001 |
3 | 11002002111021100111102 |
4 | 213232100133022301 |
5 | 1144322403130131 |
6 | 31332152254145 |
7 | 3036646026632 |
oct | 475620371261 |
9 | 132074240442 |
10 | 42652005041 |
11 | 170a7a43748 |
12 | 83240a1355 |
13 | 4039633409 |
14 | 20c88a9889 |
15 | 119973b1cb |
hex | 9ee41f2b1 |
42652005041 has 8 divisors (see below), whose sum is σ = 46381513320. Its totient is φ = 39058115328.
The previous prime is 42652005037. The next prime is 42652005059. The reversal of 42652005041 is 14050025624.
It can be written as a sum of positive squares in 4 ways, for example, as 33027610225 + 9624394816 = 181735^2 + 98104^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 42652005041 - 22 = 42652005037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42652004995 and 42652005013.
It is not an unprimeable number, because it can be changed into a prime (42652005241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33903986 + ... + 33905243.
It is an arithmetic number, because the mean of its divisors is an integer number (5797689165).
Almost surely, 242652005041 is an apocalyptic number.
It is an amenable number.
42652005041 is a deficient number, since it is larger than the sum of its proper divisors (3729508279).
42652005041 is a wasteful number, since it uses less digits than its factorization.
42652005041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67809283.
The product of its (nonzero) digits is 9600, while the sum is 29.
The spelling of 42652005041 in words is "forty-two billion, six hundred fifty-two million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •