Base | Representation |
---|---|
bin | 1010000000110111111110… |
… | …0111110010010111100011 |
3 | 1102222120002202012201021212 |
4 | 2200031333213302113203 |
5 | 2420342232413103003 |
6 | 35225553424340335 |
7 | 2214312406352615 |
oct | 240157747622743 |
9 | 42876082181255 |
10 | 11010142316003 |
11 | 3565414338056 |
12 | 1299a0a4746ab |
13 | 61b33774ca7c |
14 | 2a0c72582db5 |
15 | 1415ebcc9dd8 |
hex | a037f9f25e3 |
11010142316003 has 8 divisors (see below), whose sum is σ = 11251397878272. Its totient is φ = 10769178304456.
The previous prime is 11010142315999. The next prime is 11010142316011. The reversal of 11010142316003 is 30061324101011.
It is a happy number.
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 11010142316003 - 22 = 11010142315999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11010142316003.
It is not an unprimeable number, because it can be changed into a prime (11010142319003) 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, 72811325 + ... + 72962382.
It is an arithmetic number, because the mean of its divisors is an integer number (1406424734784).
Almost surely, 211010142316003 is an apocalyptic number.
11010142316003 is a deficient number, since it is larger than the sum of its proper divisors (241255562269).
11010142316003 is a wasteful number, since it uses less digits than its factorization.
11010142316003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145775361.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11010142316003 its reverse (30061324101011), we get a palindrome (41071466417014).
The spelling of 11010142316003 in words is "eleven trillion, ten billion, one hundred forty-two million, three hundred sixteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •