Base | Representation |
---|---|
bin | 10100101011010110… |
… | …11101001010010101 |
3 | 1001122122201220110022 |
4 | 22111223131022111 |
5 | 140213342201123 |
6 | 5033315434525 |
7 | 542045026421 |
oct | 122553351225 |
9 | 31578656408 |
10 | 11101131413 |
11 | 4787332379 |
12 | 21998b5a45 |
13 | 107bb76118 |
14 | 7744b7b81 |
15 | 44e8b91c8 |
hex | 295add295 |
11101131413 has 8 divisors (see below), whose sum is σ = 11201914968. Its totient is φ = 11000392704.
The previous prime is 11101131407. The next prime is 11101131451. The reversal of 11101131413 is 31413110111.
It can be written as a sum of positive squares in 4 ways, for example, as 446350129 + 10654781284 = 21127^2 + 103222^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11101131413 - 228 = 10832695957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11101131391 and 11101131400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101161413) 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, 674045 + ... + 690317.
It is an arithmetic number, because the mean of its divisors is an integer number (1400239371).
Almost surely, 211101131413 is an apocalyptic number.
It is an amenable number.
11101131413 is a deficient number, since it is larger than the sum of its proper divisors (100783555).
11101131413 is a wasteful number, since it uses less digits than its factorization.
11101131413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22423.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 11101131413 its reverse (31413110111), we get a palindrome (42514241524).
The spelling of 11101131413 in words is "eleven billion, one hundred one million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •