Base | Representation |
---|---|
bin | 11001010101101100110111… |
… | …110110110110010101110110 |
3 | 112121120210110012101121012011 |
4 | 121111230313312312111312 |
5 | 104101333121102221200 |
6 | 1033003542325314434 |
7 | 32321310613444636 |
oct | 3125546766662566 |
9 | 477523405347164 |
10 | 111442453554550 |
11 | 3256652a807358 |
12 | 105ba364265a1a |
13 | 4a24c943777c1 |
14 | 1d73bb49186c6 |
15 | cd3d1995d5ba |
hex | 655b37db6576 |
111442453554550 has 24 divisors (see below), whose sum is σ = 207283385561112. Its totient is φ = 44576890680000.
The previous prime is 111442453554529. The next prime is 111442453554559. The reversal of 111442453554550 is 55455354244111.
It is a junction number, because it is equal to n+sod(n) for n = 111442453554494 and 111442453554503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111442453554559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26036250 + ... + 30012850.
It is an arithmetic number, because the mean of its divisors is an integer number (8636807731713).
Almost surely, 2111442453554550 is an apocalyptic number.
111442453554550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111442453554550 is a deficient number, since it is larger than the sum of its proper divisors (95840932006562).
111442453554550 is a wasteful number, since it uses less digits than its factorization.
111442453554550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4537104 (or 4537099 counting only the distinct ones).
The product of its (nonzero) digits is 4800000, while the sum is 49.
The spelling of 111442453554550 in words is "one hundred eleven trillion, four hundred forty-two billion, four hundred fifty-three million, five hundred fifty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •