Base | Representation |
---|---|
bin | 10100011111011101… |
… | …01010110000010111 |
3 | 1001101200220110112111 |
4 | 22033232222300113 |
5 | 140012313411411 |
6 | 5015352131451 |
7 | 536423410522 |
oct | 121756526027 |
9 | 31350813474 |
10 | 11001310231 |
11 | 4735a5322a |
12 | 2170396b87 |
13 | 1064295b32 |
14 | 765131bb9 |
15 | 445c4c721 |
hex | 28fbaac17 |
11001310231 has 4 divisors (see below), whose sum is σ = 11005389000. Its totient is φ = 10997231464.
The previous prime is 11001310219. The next prime is 11001310241. The reversal of 11001310231 is 13201310011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13201310011 = 41 ⋅321983171.
It is a cyclic number.
It is not a de Polignac number, because 11001310231 - 229 = 10464439319 is a prime.
It is a super-2 number, since 2×110013102312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001310241) 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, 2035336 + ... + 2040733.
It is an arithmetic number, because the mean of its divisors is an integer number (2751347250).
Almost surely, 211001310231 is an apocalyptic number.
11001310231 is a deficient number, since it is larger than the sum of its proper divisors (4078769).
11001310231 is an equidigital number, since it uses as much as digits as its factorization.
11001310231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4078768.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11001310231 its reverse (13201310011), we get a palindrome (24202620242).
The spelling of 11001310231 in words is "eleven billion, one million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •