Base | Representation |
---|---|
bin | 1010000001000011110001… |
… | …1111011001100110001100 |
3 | 1102222212021120200002221200 |
4 | 2200100330133121212030 |
5 | 2420420230104324322 |
6 | 35231240100425500 |
7 | 2214454054001226 |
oct | 240207437314614 |
9 | 42885246602850 |
10 | 11013311011212 |
11 | 356679aa49724 |
12 | 129a5536a8290 |
13 | 61b72107a753 |
14 | 2a109333d416 |
15 | 1417350928ac |
hex | a043c7d998c |
11013311011212 has 36 divisors (see below), whose sum is σ = 28431526302816. Its totient is φ = 3592995081120.
The previous prime is 11013311011207. The next prime is 11013311011237. The reversal of 11013311011212 is 21211011331011.
11013311011212 is a `hidden beast` number, since 1 + 101 + 331 + 10 + 11 + 212 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3254522839 + ... + 3254526222.
Almost surely, 211013311011212 is an apocalyptic number.
11013311011212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013311011212 is an abundant number, since it is smaller than the sum of its proper divisors (17418215291604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013311011212 is a wasteful number, since it uses less digits than its factorization.
11013311011212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6509049118 (or 6509049113 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11013311011212 its reverse (21211011331011), we get a palindrome (32224322342223).
The spelling of 11013311011212 in words is "eleven trillion, thirteen billion, three hundred eleven million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •