Base | Representation |
---|---|
bin | 10100111000101101… |
… | …01000011111010101 |
3 | 1001221110110011201122 |
4 | 22130112220133111 |
5 | 140431024111201 |
6 | 5052355533325 |
7 | 544604614265 |
oct | 123426503725 |
9 | 31843404648 |
10 | 11213113301 |
11 | 4834567a95 |
12 | 220b2ba245 |
13 | 10991235b0 |
14 | 7853077a5 |
15 | 459638e1b |
hex | 29c5a87d5 |
11213113301 has 4 divisors (see below), whose sum is σ = 12075660492. Its totient is φ = 10350566112.
The previous prime is 11213113279. The next prime is 11213113309. The reversal of 11213113301 is 10331131211.
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 1707838276 + 9505275025 = 41326^2 + 97495^2 .
It is a cyclic number.
It is not a de Polignac number, because 11213113301 - 226 = 11146004437 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 11213113301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213113309) 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, 431273576 + ... + 431273601.
It is an arithmetic number, because the mean of its divisors is an integer number (3018915123).
Almost surely, 211213113301 is an apocalyptic number.
It is an amenable number.
11213113301 is a deficient number, since it is larger than the sum of its proper divisors (862547191).
11213113301 is an equidigital number, since it uses as much as digits as its factorization.
11213113301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 862547190.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11213113301 its reverse (10331131211), we get a palindrome (21544244512).
The spelling of 11213113301 in words is "eleven billion, two hundred thirteen million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •