Base | Representation |
---|---|
bin | 11101001100110010111… |
… | …10100101110010110101 |
3 | 10112220200212022022111011 |
4 | 32212121132211302311 |
5 | 112414230343010031 |
6 | 2044524414312221 |
7 | 132325523644102 |
oct | 16463136456265 |
9 | 3486625268434 |
10 | 1003302313141 |
11 | 357552aaa707 |
12 | 142543ab8671 |
13 | 737c34aa99b |
14 | 367bac65aa9 |
15 | 1b1716246b1 |
hex | e9997a5cb5 |
1003302313141 has 8 divisors (see below), whose sum is σ = 1005061725504. Its totient is φ = 1001544001920.
The previous prime is 1003302313129. The next prime is 1003302313147. The reversal of 1003302313141 is 1413132033001.
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 1003302313141 - 215 = 1003302280373 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 (1003302313147) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1559301 + ... + 2106661.
It is an arithmetic number, because the mean of its divisors is an integer number (125632715688).
Almost surely, 21003302313141 is an apocalyptic number.
It is an amenable number.
1003302313141 is a deficient number, since it is larger than the sum of its proper divisors (1759412363).
1003302313141 is an equidigital number, since it uses as much as digits as its factorization.
1003302313141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550571.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1003302313141 its reverse (1413132033001), we get a palindrome (2416434346142).
The spelling of 1003302313141 in words is "one trillion, three billion, three hundred two million, three hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •