Base | Representation |
---|---|
bin | 10100110111001011… |
… | …11010000110111111 |
3 | 1001220120102020121210 |
4 | 22123211322012333 |
5 | 140414241343130 |
6 | 5051222055503 |
7 | 544361215455 |
oct | 123345720677 |
9 | 31816366553 |
10 | 11200340415 |
11 | 4828333590 |
12 | 2206b7a593 |
13 | 10965a0884 |
14 | 7837409d5 |
15 | 4584645b0 |
hex | 29b97a1bf |
11200340415 has 32 divisors (see below), whose sum is σ = 20223820800. Its totient is φ = 5243208320.
The previous prime is 11200340413. The next prime is 11200340423. The reversal of 11200340415 is 51404300211.
It is not a de Polignac number, because 11200340415 - 21 = 11200340413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11200340391 and 11200340400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200340413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1165575 + ... + 1175144.
It is an arithmetic number, because the mean of its divisors is an integer number (631994400).
Almost surely, 211200340415 is an apocalyptic number.
11200340415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11200340415 is a deficient number, since it is larger than the sum of its proper divisors (9023480385).
11200340415 is a wasteful number, since it uses less digits than its factorization.
11200340415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2340767.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 11200340415 its reverse (51404300211), we get a palindrome (62604640626).
The spelling of 11200340415 in words is "eleven billion, two hundred million, three hundred forty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •