Base | Representation |
---|---|
bin | 10100100011000001… |
… | …01111010000111001 |
3 | 1001110210011200120122 |
4 | 22101200233100321 |
5 | 140042442304423 |
6 | 5022341103025 |
7 | 540235523114 |
oct | 122140572071 |
9 | 31423150518 |
10 | 11031213113 |
11 | 4750917758 |
12 | 217a3b7a75 |
13 | 106a53584b |
14 | 7690b757b |
15 | 4486a78c8 |
hex | 29182f439 |
11031213113 has 8 divisors (see below), whose sum is σ = 11681078760. Its totient is φ = 10381455360.
The previous prime is 11031213071. The next prime is 11031213143. The reversal of 11031213113 is 31131213011.
It can be written as a sum of positive squares in 4 ways, for example, as 2220011689 + 8811201424 = 47117^2 + 93868^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11031213113 - 26 = 11031213049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 11031213091 and 11031213100.
It is not an unprimeable number, because it can be changed into a prime (11031213143) 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, 290153 + ... + 325961.
It is an arithmetic number, because the mean of its divisors is an integer number (1460134845).
Almost surely, 211031213113 is an apocalyptic number.
It is an amenable number.
11031213113 is a deficient number, since it is larger than the sum of its proper divisors (649865647).
11031213113 is a wasteful number, since it uses less digits than its factorization.
11031213113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53947.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11031213113 its reverse (31131213011), we get a palindrome (42162426124).
The spelling of 11031213113 in words is "eleven billion, thirty-one million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •