Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …0111011011101000100010 |
3 | 1102221121110120000102102200 |
4 | 2200010233213123220202 |
5 | 2420211412242023020 |
6 | 35221232102554030 |
7 | 2213511314122011 |
oct | 240045747335042 |
9 | 42847416012380 |
10 | 11000210111010 |
11 | 356118791847a |
12 | 1297ab8138916 |
13 | 61a413b0b5b3 |
14 | 2a05ad42aa78 |
15 | 141219d5e590 |
hex | a012f9dba22 |
11000210111010 has 48 divisors (see below), whose sum is σ = 29140179250104. Its totient is φ = 2878042392576.
The previous prime is 11000210110997. The next prime is 11000210111039. The reversal of 11000210111010 is 1011101200011.
It can be written as a sum of positive squares in 4 ways, for example, as 10014357715209 + 985852395801 = 3164547^2 + 992901^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11000210110983 and 11000210111001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1153057087 + ... + 1153066626.
Almost surely, 211000210111010 is an apocalyptic number.
11000210111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000210111010 is an abundant number, since it is smaller than the sum of its proper divisors (18139969139094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000210111010 is a wasteful number, since it uses less digits than its factorization.
11000210111010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2306123779 (or 2306123776 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11000210111010 its reverse (1011101200011), we get a palindrome (12011311311021).
The spelling of 11000210111010 in words is "eleven trillion, two hundred ten million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •