Base | Representation |
---|---|
bin | 1010100000011110011111… |
… | …0001000000100011010011 |
3 | 1111220110110022001011020002 |
4 | 2220013213301000203103 |
5 | 3003241124143140110 |
6 | 40323222253040215 |
7 | 2301452324656202 |
oct | 250074761004323 |
9 | 44813408034202 |
10 | 11553055443155 |
11 | 3754694679096 |
12 | 1367086a8606b |
13 | 65a5aa338b75 |
14 | 2bd256c05239 |
15 | 1507c5028aa5 |
hex | a81e7c408d3 |
11553055443155 has 4 divisors (see below), whose sum is σ = 13863666531792. Its totient is φ = 9242444354520.
The previous prime is 11553055443151. The next prime is 11553055443197. The reversal of 11553055443155 is 55134455035511.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11553055443155 - 22 = 11553055443151 is a prime.
It is a super-2 number, since 2×115530554431552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11553055443151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1155305544311 + ... + 1155305544320.
It is an arithmetic number, because the mean of its divisors is an integer number (3465916632948).
Almost surely, 211553055443155 is an apocalyptic number.
11553055443155 is a deficient number, since it is larger than the sum of its proper divisors (2310611088637).
11553055443155 is an equidigital number, since it uses as much as digits as its factorization.
11553055443155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2310611088636.
The product of its (nonzero) digits is 2250000, while the sum is 47.
The spelling of 11553055443155 in words is "eleven trillion, five hundred fifty-three billion, fifty-five million, four hundred forty-three thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •