Base | Representation |
---|---|
bin | 10101010010001010… |
… | …01011111000111001 |
3 | 1002111100020122010000 |
4 | 22221011023320321 |
5 | 141400210043023 |
6 | 5125504343213 |
7 | 553106603325 |
oct | 125105137071 |
9 | 32440218100 |
10 | 11426643513 |
11 | 493405143a |
12 | 226a914b09 |
13 | 110143722c |
14 | 7a580c985 |
15 | 46d267243 |
hex | 2a914be39 |
11426643513 has 10 divisors (see below), whose sum is σ = 17069430554. Its totient is φ = 7617762288.
The previous prime is 11426643467. The next prime is 11426643521. The reversal of 11426643513 is 31534662411.
11426643513 is a `hidden beast` number, since 1 + 1 + 4 + 2 + 6 + 643 + 5 + 1 + 3 = 666.
11426643513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10771948944 + 654694569 = 103788^2 + 25587^2 .
It is not a de Polignac number, because 11426643513 - 28 = 11426643257 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11426643413) 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 9 ways as a sum of consecutive naturals, for example, 70534756 + ... + 70534917.
Almost surely, 211426643513 is an apocalyptic number.
It is an amenable number.
11426643513 is a deficient number, since it is larger than the sum of its proper divisors (5642787041).
11426643513 is an equidigital number, since it uses as much as digits as its factorization.
11426643513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141069685 (or 141069676 counting only the distinct ones).
The product of its digits is 51840, while the sum is 36.
The spelling of 11426643513 in words is "eleven billion, four hundred twenty-six million, six hundred forty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •