Base | Representation |
---|---|
bin | 1010001100100100001110… |
… | …1110110111100000011100 |
3 | 1110200202112221021011112210 |
4 | 2203021003232313200130 |
5 | 2432140112224031022 |
6 | 35502132431200420 |
7 | 2234653025125440 |
oct | 243110356674034 |
9 | 43622487234483 |
10 | 11211001002012 |
11 | 3632616882809 |
12 | 1310925676110 |
13 | 63426792b976 |
14 | 2aa888708820 |
15 | 146955819a0c |
hex | a3243bb781c |
11211001002012 has 48 divisors (see below), whose sum is σ = 29898617837312. Its totient is φ = 3202862947200.
The previous prime is 11211001001999. The next prime is 11211001002013. The reversal of 11211001002012 is 21020010011211.
It is a super-2 number, since 2×112110010020122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211001002013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4870489 + ... + 6792912.
Almost surely, 211211001002012 is an apocalyptic number.
11211001002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11211001002012 is an abundant number, since it is smaller than the sum of its proper divisors (18687616835300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211001002012 is a wasteful number, since it uses less digits than its factorization.
11211001002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11674858 (or 11674856 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11211001002012 its reverse (21020010011211), we get a palindrome (32231011013223).
The spelling of 11211001002012 in words is "eleven trillion, two hundred eleven billion, one million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •