Base | Representation |
---|---|
bin | 10111000001010001001010… |
… | …110011011100001101101011 |
3 | 111021110122212200010011200020 |
4 | 113001101022303130031223 |
5 | 101232223033332201303 |
6 | 555154011412211523 |
7 | 30216336456602244 |
oct | 2701211263341553 |
9 | 437418780104606 |
10 | 101242224100203 |
11 | 2a29364a14174a |
12 | b431508009ba3 |
13 | 4465140502314 |
14 | 1b00215059ccb |
15 | ba882136ea53 |
hex | 5c144acdc36b |
101242224100203 has 8 divisors (see below), whose sum is σ = 142094349614400. Its totient is φ = 63942457326408.
The previous prime is 101242224100169. The next prime is 101242224100229. The reversal of 101242224100203 is 302001422242101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101242224100203 - 29 = 101242224099691 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101242224100243) 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, 888089685033 + ... + 888089685146.
It is an arithmetic number, because the mean of its divisors is an integer number (17761793701800).
Almost surely, 2101242224100203 is an apocalyptic number.
101242224100203 is a deficient number, since it is larger than the sum of its proper divisors (40852125514197).
101242224100203 is a wasteful number, since it uses less digits than its factorization.
101242224100203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1776179370201.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 101242224100203 its reverse (302001422242101), we get a palindrome (403243646342304).
The spelling of 101242224100203 in words is "one hundred one trillion, two hundred forty-two billion, two hundred twenty-four million, one hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •