Base | Representation |
---|---|
bin | 1010000111110111011101… |
… | …0100101000101001010101 |
3 | 1110102001011002220010121010 |
4 | 2201331313110220221111 |
5 | 2424324234103141010 |
6 | 35401101041442433 |
7 | 2226064162245360 |
oct | 241756724505125 |
9 | 43361132803533 |
10 | 11130262162005 |
11 | 3601354909258 |
12 | 12b9152340419 |
13 | 62976b708c1c |
14 | 2a69c97a50d7 |
15 | 1447cc555620 |
hex | a1f77528a55 |
11130262162005 has 64 divisors (see below), whose sum is σ = 20635882426368. Its totient is φ = 5017300185600.
The previous prime is 11130262162001. The next prime is 11130262162037. The reversal of 11130262162005 is 50026126203111.
It is not a de Polignac number, because 11130262162005 - 22 = 11130262162001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130262162001) 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, 34693080 + ... + 35012430.
It is an arithmetic number, because the mean of its divisors is an integer number (322435662912).
Almost surely, 211130262162005 is an apocalyptic number.
11130262162005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11130262162005 is a deficient number, since it is larger than the sum of its proper divisors (9505620264363).
11130262162005 is a wasteful number, since it uses less digits than its factorization.
11130262162005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323986.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 11130262162005 its reverse (50026126203111), we get a palindrome (61156388365116).
The spelling of 11130262162005 in words is "eleven trillion, one hundred thirty billion, two hundred sixty-two million, one hundred sixty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •