Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0011111100110111100100 |
3 | 1102222120022020021101110220 |
4 | 2200032010103330313210 |
5 | 2420342413034032322 |
6 | 35230005315044340 |
7 | 2214314353234515 |
oct | 240160423746744 |
9 | 42876266241426 |
10 | 11010221002212 |
11 | 35654547a1183 |
12 | 1299a308a06b0 |
13 | 61b34ab40163 |
14 | 2a0c7cbc6a0c |
15 | 141603b6e55c |
hex | a03844fcde4 |
11010221002212 has 24 divisors (see below), whose sum is σ = 25692592355136. Its totient is φ = 3669776998368.
The previous prime is 11010221002141. The next prime is 11010221002219. The reversal of 11010221002212 is 21220012201011.
It is a junction number, because it is equal to n+sod(n) for n = 11010221002191 and 11010221002200.
It is not an unprimeable number, because it can be changed into a prime (11010221002219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36928968 + ... + 37225919.
It is an arithmetic number, because the mean of its divisors is an integer number (1070524681464).
Almost surely, 211010221002212 is an apocalyptic number.
11010221002212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11010221002212 is an abundant number, since it is smaller than the sum of its proper divisors (14682371352924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010221002212 is a wasteful number, since it uses less digits than its factorization.
11010221002212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74167267 (or 74167265 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11010221002212 its reverse (21220012201011), we get a palindrome (32230233203223).
The spelling of 11010221002212 in words is "eleven trillion, ten billion, two hundred twenty-one million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •