Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110011001110000011010 |
3 | 1102222112222210121100101020 |
4 | 2200031331012121300122 |
5 | 2420342141100310020 |
6 | 35225545313503310 |
7 | 2214311353641543 |
oct | 240157506316032 |
9 | 42875883540336 |
10 | 11010100010010 |
11 | 35653a2471a22 |
12 | 12999b8271b36 |
13 | 61b32ba5973a |
14 | 2a0c6aacd4ca |
15 | 1415e821ec40 |
hex | a037d199c1a |
11010100010010 has 64 divisors (see below), whose sum is σ = 26621745171840. Its totient is φ = 2914093405440.
The previous prime is 11010100010009. The next prime is 11010100010011. The reversal of 11010100010010 is 1001000101011.
It is an interprime number because it is at equal distance from previous prime (11010100010009) and next prime (11010100010011).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (11010100010011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14700820 + ... + 15431600.
It is an arithmetic number, because the mean of its divisors is an integer number (415964768310).
Almost surely, 211010100010010 is an apocalyptic number.
11010100010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010100010010 is an abundant number, since it is smaller than the sum of its proper divisors (15611645161830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010100010010 is a wasteful number, since it uses less digits than its factorization.
11010100010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 734543.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11010100010010 its reverse (1001000101011), we get a palindrome (12011100111021).
The spelling of 11010100010010 in words is "eleven trillion, ten billion, one hundred million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •