Base | Representation |
---|---|
bin | 10100111011100001111… |
… | …101010001110100100001 |
3 | 12002111112022001011100012 |
4 | 110323201331101310201 |
5 | 142031124330423431 |
6 | 3020430035134305 |
7 | 205625443254452 |
oct | 24734175216441 |
9 | 5074468034305 |
10 | 1438310014241 |
11 | 504a90562a91 |
12 | 1b2907144395 |
13 | a582a808059 |
14 | 4d88657b129 |
15 | 276315c022b |
hex | 14ee1f51d21 |
1438310014241 has 8 divisors (see below), whose sum is σ = 1467612595944. Its totient is φ = 1409087605120.
The previous prime is 1438310014237. The next prime is 1438310014277. The reversal of 1438310014241 is 1424100138341.
It can be written as a sum of positive squares in 4 ways, for example, as 1020827329600 + 417482684641 = 1010360^2 + 646129^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 1438310014241 - 22 = 1438310014237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1438310014198 and 1438310014207.
It is not an unprimeable number, because it can be changed into a prime (1438310019241) 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, 20006900 + ... + 20078661.
It is an arithmetic number, because the mean of its divisors is an integer number (183451574493).
Almost surely, 21438310014241 is an apocalyptic number.
It is an amenable number.
1438310014241 is a deficient number, since it is larger than the sum of its proper divisors (29302581703).
1438310014241 is an equidigital number, since it uses as much as digits as its factorization.
1438310014241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40086291.
The product of its (nonzero) digits is 9216, while the sum is 32.
The spelling of 1438310014241 in words is "one trillion, four hundred thirty-eight billion, three hundred ten million, fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •