Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0101101111100001110010 |
3 | 1102222122100012220200100121 |
4 | 2200032303111233201302 |
5 | 2420401022030013020 |
6 | 35230215502040454 |
7 | 2214343043511535 |
oct | 240166325574162 |
9 | 42878305820317 |
10 | 11011010001010 |
11 | 356581a0a86a8 |
12 | 129a010b7912a |
13 | 61b445440856 |
14 | 2a0d158caa1c |
15 | 14164d071baa |
hex | a03b356f872 |
11011010001010 has 8 divisors (see below), whose sum is σ = 19819818001836. Its totient is φ = 4404404000400.
The previous prime is 11011010000993. The next prime is 11011010001071. The reversal of 11011010001010 is 1010001011011.
It is a happy number.
11011010001010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10290346532449 + 720663468561 = 3207857^2 + 848919^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11011010000984 and 11011010001002.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550550500041 + ... + 550550500060.
Almost surely, 211011010001010 is an apocalyptic number.
11011010001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011010001010 is a deficient number, since it is larger than the sum of its proper divisors (8808808000826).
11011010001010 is a wasteful number, since it uses less digits than its factorization.
11011010001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1101101000108.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11011010001010 its reverse (1010001011011), we get a palindrome (12021011012021).
The spelling of 11011010001010 in words is "eleven trillion, eleven billion, ten million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •