Base | Representation |
---|---|
bin | 10100100010001101… |
… | …11001110001011101 |
3 | 1001110022102121011220 |
4 | 22101012321301131 |
5 | 140034224043123 |
6 | 5021540003553 |
7 | 540124124460 |
oct | 122106716135 |
9 | 31408377156 |
10 | 11024440413 |
11 | 4748011288 |
12 | 21780905b9 |
13 | 1069003c2c |
14 | 7682332d7 |
15 | 447cbace3 |
hex | 2911b9c5d |
11024440413 has 32 divisors (see below), whose sum is σ = 17447143680. Its totient is φ = 6060510720.
The previous prime is 11024440409. The next prime is 11024440423. The reversal of 11024440413 is 31404442011.
11024440413 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 11024440413 - 22 = 11024440409 is a prime.
It is a super-2 number, since 2×110244404132 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11024440403) 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 31 ways as a sum of consecutive naturals, for example, 10558 + ... + 148863.
It is an arithmetic number, because the mean of its divisors is an integer number (545223240).
Almost surely, 211024440413 is an apocalyptic number.
It is an amenable number.
11024440413 is a deficient number, since it is larger than the sum of its proper divisors (6422703267).
11024440413 is a wasteful number, since it uses less digits than its factorization.
11024440413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159557.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 11024440413 its reverse (31404442011), we get a palindrome (42428882424).
The spelling of 11024440413 in words is "eleven billion, twenty-four million, four hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •