Base | Representation |
---|---|
bin | 100011011110110000111… |
… | …010101010001100000001 |
3 | 22122002110100222021000101 |
4 | 203132300322222030001 |
5 | 304421430420432001 |
6 | 5104033401122401 |
7 | 341104142231032 |
oct | 43366072521401 |
9 | 8562410867011 |
10 | 2438214624001 |
11 | 86004a655872 |
12 | 334661189401 |
13 | 148bcc0b5360 |
14 | 86020072a89 |
15 | 43654792a01 |
hex | 237b0eaa301 |
2438214624001 has 8 divisors (see below), whose sum is σ = 2668814999144. Its totient is φ = 2213763592320.
The previous prime is 2438214623993. The next prime is 2438214624011. The reversal of 2438214624001 is 1004264128342.
It can be written as a sum of positive squares in 4 ways, for example, as 42526688400 + 2395687935601 = 206220^2 + 1547801^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 2438214624001 - 23 = 2438214623993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2438214624011) 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, 1537335036 + ... + 1537336621.
It is an arithmetic number, because the mean of its divisors is an integer number (333601874893).
Almost surely, 22438214624001 is an apocalyptic number.
It is an amenable number.
2438214624001 is a deficient number, since it is larger than the sum of its proper divisors (230600375143).
2438214624001 is a wasteful number, since it uses less digits than its factorization.
2438214624001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3074671731.
The product of its (nonzero) digits is 73728, while the sum is 37.
The spelling of 2438214624001 in words is "two trillion, four hundred thirty-eight billion, two hundred fourteen million, six hundred twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •