Base | Representation |
---|---|
bin | 10100110111100001… |
… | …00101101010001011 |
3 | 1001220202200111020211 |
4 | 22123300211222023 |
5 | 140421000441420 |
6 | 5051402101551 |
7 | 544424056300 |
oct | 123360455213 |
9 | 31822614224 |
10 | 11203140235 |
11 | 4829976091 |
12 | 2207aaa8b7 |
13 | 1097041081 |
14 | 783c6d0a7 |
15 | 458818e5a |
hex | 29bc25a8b |
11203140235 has 48 divisors (see below), whose sum is σ = 16035148800. Its totient is φ = 7488137664.
The previous prime is 11203140203. The next prime is 11203140239. The reversal of 11203140235 is 53204130211.
It is a happy number.
11203140235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11203140235 - 25 = 11203140203 is a prime.
It is a super-2 number, since 2×112031402352 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11203140239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7784646 + ... + 7786084.
It is an arithmetic number, because the mean of its divisors is an integer number (334065600).
Almost surely, 211203140235 is an apocalyptic number.
11203140235 is a deficient number, since it is larger than the sum of its proper divisors (4832008565).
11203140235 is a wasteful number, since it uses less digits than its factorization.
11203140235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240 (or 2233 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 11203140235 its reverse (53204130211), we get a palindrome (64407270446).
The spelling of 11203140235 in words is "eleven billion, two hundred three million, one hundred forty thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •