Base | Representation |
---|---|
bin | 10100111111001011101… |
… | …010101010110010110101 |
3 | 12002212122120002002120202 |
4 | 110333023222222302311 |
5 | 142112142114114331 |
6 | 3022315103410245 |
7 | 206124554160461 |
oct | 24771352526265 |
9 | 5085576062522 |
10 | 1442231004341 |
11 | 506712891976 |
12 | 1b36202b3985 |
13 | a6003c54c3a |
14 | 4db392054a1 |
15 | 277b0939ecb |
hex | 14fcbaaacb5 |
1442231004341 has 4 divisors (see below), whose sum is σ = 1443545710092. Its totient is φ = 1440916298592.
The previous prime is 1442231004307. The next prime is 1442231004353. The reversal of 1442231004341 is 1434001322441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 329372688100 + 1112858316241 = 573910^2 + 1054921^2 .
It is a cyclic number.
It is not a de Polignac number, because 1442231004341 - 238 = 1167353097397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442231004391) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 657351230 + ... + 657353423.
It is an arithmetic number, because the mean of its divisors is an integer number (360886427523).
Almost surely, 21442231004341 is an apocalyptic number.
It is an amenable number.
1442231004341 is a deficient number, since it is larger than the sum of its proper divisors (1314705751).
1442231004341 is a wasteful number, since it uses less digits than its factorization.
1442231004341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1314705750.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1442231004341 its reverse (1434001322441), we get a palindrome (2876232326782).
The spelling of 1442231004341 in words is "one trillion, four hundred forty-two billion, two hundred thirty-one million, four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •