Base | Representation |
---|---|
bin | 1010000001001011010011… |
… | …0101101110100011011111 |
3 | 1110000001111021222222102022 |
4 | 2200102310311232203133 |
5 | 2420433344003131033 |
6 | 35232212305250355 |
7 | 2214555102142313 |
oct | 240226465564337 |
9 | 43001437888368 |
10 | 11015330130143 |
11 | 3567636764659 |
12 | 129aa179339bb |
13 | 61b98348a191 |
14 | 2a1205573b43 |
15 | 141802480098 |
hex | a04b4d6e8df |
11015330130143 has 4 divisors (see below), whose sum is σ = 11313041755320. Its totient is φ = 10717618504968.
The previous prime is 11015330130127. The next prime is 11015330130151. The reversal of 11015330130143 is 34103103351011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11015330130143 - 24 = 11015330130127 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 (11015330130193) 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 3 ways as a sum of consecutive naturals, for example, 148855812533 + ... + 148855812606.
It is an arithmetic number, because the mean of its divisors is an integer number (2828260438830).
Almost surely, 211015330130143 is an apocalyptic number.
11015330130143 is a deficient number, since it is larger than the sum of its proper divisors (297711625177).
11015330130143 is an equidigital number, since it uses as much as digits as its factorization.
11015330130143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297711625176.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 11015330130143 its reverse (34103103351011), we get a palindrome (45118433481154).
The spelling of 11015330130143 in words is "eleven trillion, fifteen billion, three hundred thirty million, one hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •