Base | Representation |
---|---|
bin | 111010110100111001011… |
… | …111000010101011001001 |
3 | 112022110110202212200200200 |
4 | 322310321133002223021 |
5 | 1012213044314224030 |
6 | 12333040110522413 |
7 | 565030425456000 |
oct | 72647137025311 |
9 | 15273422780620 |
10 | 4042528664265 |
11 | 1319477051593 |
12 | 553576806409 |
13 | 234293a05430 |
14 | dd93369dc37 |
15 | 7024e980d60 |
hex | 3ad397c2ac9 |
4042528664265 has 192 divisors, whose sum is σ = 8898978816000. Its totient is φ = 1686683851776.
The previous prime is 4042528664221. The next prime is 4042528664281. The reversal of 4042528664265 is 5624668252404.
4042528664265 is a `hidden beast` number, since 4 + 0 + 42 + 5 + 286 + 64 + 265 = 666.
It is not a de Polignac number, because 4042528664265 - 27 = 4042528664137 is a prime.
It is an unprimeable number.
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 191 ways as a sum of consecutive naturals, for example, 17745112 + ... + 17971478.
It is an arithmetic number, because the mean of its divisors is an integer number (46348848000).
Almost surely, 24042528664265 is an apocalyptic number.
4042528664265 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4042528664265 is an abundant number, since it is smaller than the sum of its proper divisors (4856450151735).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4042528664265 is a wasteful number, since it uses less digits than its factorization.
4042528664265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226501 (or 226484 counting only the distinct ones).
The product of its (nonzero) digits is 22118400, while the sum is 54.
The spelling of 4042528664265 in words is "four trillion, forty-two billion, five hundred twenty-eight million, six hundred sixty-four thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •