Base | Representation |
---|---|
bin | 1010000111111010010010… |
… | …1110111110000010100101 |
3 | 1110102010010012111112212101 |
4 | 2201332210232332002211 |
5 | 2424332314123240401 |
6 | 35401304415252101 |
7 | 2226122103145330 |
oct | 241764456760245 |
9 | 43363105445771 |
10 | 11131024040101 |
11 | 3601705981579 |
12 | 12b932551a031 |
13 | 629860502074 |
14 | 2a6a5ca49617 |
15 | 14482439c101 |
hex | a1fa4bbe0a5 |
11131024040101 has 8 divisors (see below), whose sum is σ = 12723671093760. Its totient is φ = 9539002177008.
The previous prime is 11131024040033. The next prime is 11131024040107. The reversal of 11131024040101 is 10104042013111.
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 11131024040101 - 27 = 11131024039973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131024040107) 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 7 ways as a sum of consecutive naturals, for example, 156259486 + ... + 156330703.
It is an arithmetic number, because the mean of its divisors is an integer number (1590458886720).
Almost surely, 211131024040101 is an apocalyptic number.
It is an amenable number.
11131024040101 is a deficient number, since it is larger than the sum of its proper divisors (1592647053659).
11131024040101 is an equidigital number, since it uses as much as digits as its factorization.
11131024040101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312595283.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11131024040101 its reverse (10104042013111), we get a palindrome (21235066053212).
The spelling of 11131024040101 in words is "eleven trillion, one hundred thirty-one billion, twenty-four million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •