Base | Representation |
---|---|
bin | 10101000111111101… |
… | …00100000011100101 |
3 | 1002021101010120200010 |
4 | 22203332210003211 |
5 | 141211300141123 |
6 | 5113205240433 |
7 | 551020043241 |
oct | 124376440345 |
9 | 32241116603 |
10 | 11341021413 |
11 | 489a790277 |
12 | 2246103119 |
13 | 10b9788b77 |
14 | 7982c1421 |
15 | 4659a2993 |
hex | 2a3fa40e5 |
11341021413 has 16 divisors (see below), whose sum is σ = 15151147200. Its totient is φ = 7545807360.
The previous prime is 11341021403. The next prime is 11341021427. The reversal of 11341021413 is 31412014311.
11341021413 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 11341021413 - 25 = 11341021381 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11341021413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11341021403) 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 15 ways as a sum of consecutive naturals, for example, 6002773 + ... + 6004661.
It is an arithmetic number, because the mean of its divisors is an integer number (946946700).
Almost surely, 211341021413 is an apocalyptic number.
It is an amenable number.
11341021413 is a deficient number, since it is larger than the sum of its proper divisors (3810125787).
11341021413 is a wasteful number, since it uses less digits than its factorization.
11341021413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4772.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11341021413 its reverse (31412014311), we get a palindrome (42753035724).
The spelling of 11341021413 in words is "eleven billion, three hundred forty-one million, twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •