Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011011100111110001110 |
3 | 1102222122022120222222220101 |
4 | 2200032302303130332032 |
5 | 2420401012224341420 |
6 | 35230214541241314 |
7 | 2214342604223041 |
oct | 240166263347616 |
9 | 42878276888811 |
10 | 11011001012110 |
11 | 3565815019160 |
12 | 129a009b6323a |
13 | 61b443614288 |
14 | 2a0d1462ac58 |
15 | 14164c39860a |
hex | a03b2cdcf8e |
11011001012110 has 32 divisors (see below), whose sum is σ = 21627733059072. Its totient is φ = 4002864984480.
The previous prime is 11011001012017. The next prime is 11011001012191. The reversal of 11011001012110 is 1121010011011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
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, 13802562 + ... + 14578501.
It is an arithmetic number, because the mean of its divisors is an integer number (675866658096).
Almost surely, 211011001012110 is an apocalyptic number.
11011001012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011001012110 is a deficient number, since it is larger than the sum of its proper divisors (10616732046962).
11011001012110 is a wasteful number, since it uses less digits than its factorization.
11011001012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28384608.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11011001012110 its reverse (1121010011011), we get a palindrome (12132011023121).
The spelling of 11011001012110 in words is "eleven trillion, eleven billion, one million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •