Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1010001100011101001111 |
3 | 1102222122121220022101100210 |
4 | 2200032321322030131033 |
5 | 2420401233234014413 |
6 | 35230234440253503 |
7 | 2214345552404622 |
oct | 240167172143517 |
9 | 42878556271323 |
10 | 11011120219983 |
11 | 3565876339864 |
12 | 129a041a71293 |
13 | 61b462221790 |
14 | 2a0d263bbdb9 |
15 | 141657a943c3 |
hex | a03b9e8c74f |
11011120219983 has 16 divisors (see below), whose sum is σ = 16642988727680. Its totient is φ = 6419438508384.
The previous prime is 11011120219969. The next prime is 11011120219987. The reversal of 11011120219983 is 38991202111011.
It is not a de Polignac number, because 11011120219983 - 220 = 11011119171407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011120219987) 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 15 ways as a sum of consecutive naturals, for example, 7429904941 + ... + 7429906422.
It is an arithmetic number, because the mean of its divisors is an integer number (1040186795480).
Almost surely, 211011120219983 is an apocalyptic number.
11011120219983 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11011120219983 is a deficient number, since it is larger than the sum of its proper divisors (5631868507697).
11011120219983 is a wasteful number, since it uses less digits than its factorization.
11011120219983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14859811398.
The product of its (nonzero) digits is 7776, while the sum is 39.
The spelling of 11011120219983 in words is "eleven trillion, eleven billion, one hundred twenty million, two hundred nineteen thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •