Base | Representation |
---|---|
bin | 1010000111111010101100… |
… | …1100100001110100001001 |
3 | 1110102010101202111110011210 |
4 | 2201332223030201310021 |
5 | 2424333024401431410 |
6 | 35401323251043333 |
7 | 2226124560504321 |
oct | 241765314416411 |
9 | 43363352443153 |
10 | 11131132452105 |
11 | 3601761099076 |
12 | 12b93558a0549 |
13 | 629879acc693 |
14 | 2a6a6d1ca281 |
15 | 14482db64220 |
hex | a1fab321d09 |
11131132452105 has 8 divisors (see below), whose sum is σ = 17809811923392. Its totient is φ = 5936603974448.
The previous prime is 11131132452059. The next prime is 11131132452107. The reversal of 11131132452105 is 50125423113111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11131132452105 - 210 = 11131132451081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11131132452107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 371037748389 + ... + 371037748418.
It is an arithmetic number, because the mean of its divisors is an integer number (2226226490424).
Almost surely, 211131132452105 is an apocalyptic number.
11131132452105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11131132452105 is a deficient number, since it is larger than the sum of its proper divisors (6678679471287).
11131132452105 is an equidigital number, since it uses as much as digits as its factorization.
11131132452105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742075496815.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 11131132452105 its reverse (50125423113111), we get a palindrome (61256555565216).
The spelling of 11131132452105 in words is "eleven trillion, one hundred thirty-one billion, one hundred thirty-two million, four hundred fifty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •