Base | Representation |
---|---|
bin | 10101100001010011… |
… | …01001001111100101 |
3 | 1002211012012210112010 |
4 | 22300221221033211 |
5 | 142130213011240 |
6 | 5150242344433 |
7 | 556211221563 |
oct | 126051511745 |
9 | 32735183463 |
10 | 11553641445 |
11 | 4999802905 |
12 | 22a535b119 |
13 | 1121841438 |
14 | 7b862aa33 |
15 | 4794a1280 |
hex | 2b0a693e5 |
11553641445 has 8 divisors (see below), whose sum is σ = 18485826336. Its totient is φ = 6161942096.
The previous prime is 11553641431. The next prime is 11553641447. The reversal of 11553641445 is 54414635511.
11553641445 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11553641445 - 218 = 11553379301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11553641447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 385121367 + ... + 385121396.
It is an arithmetic number, because the mean of its divisors is an integer number (2310728292).
Almost surely, 211553641445 is an apocalyptic number.
11553641445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11553641445 is a deficient number, since it is larger than the sum of its proper divisors (6932184891).
11553641445 is an equidigital number, since it uses as much as digits as its factorization.
11553641445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 770242771.
The product of its digits is 144000, while the sum is 39.
The spelling of 11553641445 in words is "eleven billion, five hundred fifty-three million, six hundred forty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •