Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010000100101001100110 |
3 | 1102222120021121120012000011 |
4 | 2200032003302010221212 |
5 | 2420342403300334230 |
6 | 35230004400440434 |
7 | 2214314214605362 |
oct | 240160362045146 |
9 | 42876247505004 |
10 | 11010212121190 |
11 | 356544a785797 |
12 | 1299a2991911a |
13 | 61b349050a09 |
14 | 2a0c7b9542a2 |
15 | 141602eb7e2a |
hex | a0383c84a66 |
11010212121190 has 8 divisors (see below), whose sum is σ = 19818381818160. Its totient is φ = 4404084848472.
The previous prime is 11010212121169. The next prime is 11010212121191. The reversal of 11010212121190 is 9112121201011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110102121211902 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010212121191) 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 3 ways as a sum of consecutive naturals, for example, 550510606050 + ... + 550510606069.
It is an arithmetic number, because the mean of its divisors is an integer number (2477297727270).
Almost surely, 211010212121190 is an apocalyptic number.
11010212121190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010212121190 is a deficient number, since it is larger than the sum of its proper divisors (8808169696970).
11010212121190 is a wasteful number, since it uses less digits than its factorization.
11010212121190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101021212126.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 11010212121190 in words is "eleven trillion, ten billion, two hundred twelve million, one hundred twenty-one thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •