Base | Representation |
---|---|
bin | 10101011011100011… |
… | …01101111111101101 |
3 | 1002200211111012221012 |
4 | 22231301231333231 |
5 | 142030342121123 |
6 | 5141401115005 |
7 | 555054340145 |
oct | 125561557755 |
9 | 32624435835 |
10 | 11505426413 |
11 | 4974571178 |
12 | 2291188a65 |
13 | 111485c630 |
14 | 7b2079925 |
15 | 47512a378 |
hex | 2adc6dfed |
11505426413 has 64 divisors (see below), whose sum is σ = 14060293632. Its totient is φ = 9306316800.
The previous prime is 11505426403. The next prime is 11505426419. The reversal of 11505426413 is 31462450511.
It is not a de Polignac number, because 11505426413 - 226 = 11438317549 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 11505426413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11505426419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 37476806 + ... + 37477112.
It is an arithmetic number, because the mean of its divisors is an integer number (219692088).
Almost surely, 211505426413 is an apocalyptic number.
11505426413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11505426413 is a deficient number, since it is larger than the sum of its proper divisors (2554867219).
11505426413 is a wasteful number, since it uses less digits than its factorization.
11505426413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 11505426413 its reverse (31462450511), we get a palindrome (42967876924).
The spelling of 11505426413 in words is "eleven billion, five hundred five million, four hundred twenty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •