Base | Representation |
---|---|
bin | 10100101110111010… |
… | …11100010011001101 |
3 | 1001201201222000022212 |
4 | 22113131130103031 |
5 | 140244014343201 |
6 | 5040304120205 |
7 | 542560020623 |
oct | 122735342315 |
9 | 31651860285 |
10 | 11131012301 |
11 | 47a2191322 |
12 | 21a7906065 |
13 | 1085108b16 |
14 | 778455513 |
15 | 45231cabb |
hex | 29775c4cd |
11131012301 has 4 divisors (see below), whose sum is σ = 11158227900. Its totient is φ = 11103796704.
The previous prime is 11131012273. The next prime is 11131012309. The reversal of 11131012301 is 10321013111.
It is a happy number.
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 9225602500 + 1905409801 = 96050^2 + 43651^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131012301 - 214 = 11130995917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131012309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13607186 + ... + 13608003.
It is an arithmetic number, because the mean of its divisors is an integer number (2789556975).
Almost surely, 211131012301 is an apocalyptic number.
It is an amenable number.
11131012301 is a deficient number, since it is larger than the sum of its proper divisors (27215599).
11131012301 is an equidigital number, since it uses as much as digits as its factorization.
11131012301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27215598.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 11131012301 its reverse (10321013111), we get a palindrome (21452025412).
The spelling of 11131012301 in words is "eleven billion, one hundred thirty-one million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •