Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011011100101101000010 |
3 | 1102222122022120222221101122 |
4 | 2200032302303130231002 |
5 | 2420401012224323020 |
6 | 35230214541232242 |
7 | 2214342604216610 |
oct | 240166263345502 |
9 | 42878276887348 |
10 | 11011001011010 |
11 | 3565815018350 |
12 | 129a009b62682 |
13 | 61b443613920 |
14 | 2a0d1462a6b0 |
15 | 14164c398125 |
hex | a03b2cdcb42 |
11011001011010 has 128 divisors (see below), whose sum is σ = 26639869939200. Its totient is φ = 3164587499520.
The previous prime is 11011001010937. The next prime is 11011001011013. The reversal of 11011001011010 is 1011010011011.
11011001011010 is a modest number, since divided by 1011010 gives 110110 as remainder.
It is not an unprimeable number, because it can be changed into a prime (11011001011013) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8707256 + ... + 9891324.
It is an arithmetic number, because the mean of its divisors is an integer number (208123983900).
Almost surely, 211011001011010 is an apocalyptic number.
11011001011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011001011010 is an abundant number, since it is smaller than the sum of its proper divisors (15628868928190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011001011010 is a wasteful number, since it uses less digits than its factorization.
11011001011010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1185036.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 11011001011010 its reverse (1011010011011), we get a palindrome (12022011022021).
Subtracting from 11011001011010 its reverse (1011010011011), we obtain a palindrome (9999990999999).
The spelling of 11011001011010 in words is "eleven trillion, eleven billion, one million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •