Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …1000010010101001110001 |
3 | 1110022020122121122012111002 |
4 | 2201202213320102221301 |
5 | 2423334333040410101 |
6 | 35335422354131345 |
7 | 2224010266325516 |
oct | 241424770225161 |
9 | 43266577565432 |
10 | 11101012044401 |
11 | 359aa04994a44 |
12 | 12b354a580b55 |
13 | 626a897c9c26 |
14 | 2a5412b9b30d |
15 | 143b696a3d6b |
hex | a18a7e12a71 |
11101012044401 has 4 divisors (see below), whose sum is σ = 11225742516900. Its totient is φ = 10976281571904.
The previous prime is 11101012044389. The next prime is 11101012044403. The reversal of 11101012044401 is 10444021010111.
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 3354670643776 + 7746341400625 = 1831576^2 + 2783225^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101012044401 - 26 = 11101012044337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11101012044403) 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, 62365236116 + ... + 62365236293.
It is an arithmetic number, because the mean of its divisors is an integer number (2806435629225).
Almost surely, 211101012044401 is an apocalyptic number.
It is an amenable number.
11101012044401 is a deficient number, since it is larger than the sum of its proper divisors (124730472499).
11101012044401 is an equidigital number, since it uses as much as digits as its factorization.
11101012044401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124730472498.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 11101012044401 its reverse (10444021010111), we get a palindrome (21545033054512).
The spelling of 11101012044401 in words is "eleven trillion, one hundred one billion, twelve million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •