Base | Representation |
---|---|
bin | 1010000000111011111011… |
… | …0011101110101110010101 |
3 | 1102222122211121222010210211 |
4 | 2200032332303232232111 |
5 | 2420401420304131123 |
6 | 35230250534045421 |
7 | 2214350601126031 |
oct | 240167663565625 |
9 | 42878747863724 |
10 | 11011202411413 |
11 | 3565908777466 |
12 | 129a0654a9871 |
13 | 61b47626b469 |
14 | 2a0d332951c1 |
15 | 14165edcc40d |
hex | a03beceeb95 |
11011202411413 has 8 divisors (see below), whose sum is σ = 11490078015936. Its totient is φ = 10532337446400.
The previous prime is 11011202411333. The next prime is 11011202411449. The reversal of 11011202411413 is 31411420211011.
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 11011202411413 - 213 = 11011202403221 is a prime.
It is a super-2 number, since 2×110112024114132 (a number of 27 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 (11011202411213) 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, 507948 + ... + 4720213.
It is an arithmetic number, because the mean of its divisors is an integer number (1436259751992).
Almost surely, 211011202411413 is an apocalyptic number.
It is an amenable number.
11011202411413 is a deficient number, since it is larger than the sum of its proper divisors (478875604523).
11011202411413 is an equidigital number, since it uses as much as digits as its factorization.
11011202411413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5319755.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 11011202411413 its reverse (31411420211011), we get a palindrome (42422622622424).
The spelling of 11011202411413 in words is "eleven trillion, eleven billion, two hundred two million, four hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •