Base | Representation |
---|---|
bin | 1011000110110001101000… |
… | …0111001000110000010011 |
3 | 1121020100210200102222100112 |
4 | 2301230122013020300103 |
5 | 3100031142201213021 |
6 | 41545400401311535 |
7 | 2400134465201300 |
oct | 261543207106023 |
9 | 47210720388315 |
10 | 12211030101011 |
11 | 398873a173165 |
12 | 14526b53355ab |
13 | 6a7658c45341 |
14 | 3030349680a7 |
15 | 1629848ccd5b |
hex | b1b1a1c8c13 |
12211030101011 has 6 divisors (see below), whose sum is σ = 14204667668580. Its totient is φ = 10466597229396.
The previous prime is 12211030100989. The next prime is 12211030101091. The reversal of 12211030101011 is 11010103011221.
It is a de Polignac number, because none of the positive numbers 2k-12211030101011 is a prime.
It is a super-2 number, since 2×122110301010112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211030101091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 124602347921 + ... + 124602348018.
It is an arithmetic number, because the mean of its divisors is an integer number (2367444611430).
Almost surely, 212211030101011 is an apocalyptic number.
12211030101011 is a deficient number, since it is larger than the sum of its proper divisors (1993637567569).
12211030101011 is an equidigital number, since it uses as much as digits as its factorization.
12211030101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249204695953 (or 249204695946 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 12211030101011 its reverse (11010103011221), we get a palindrome (23221133112232).
The spelling of 12211030101011 in words is "twelve trillion, two hundred eleven billion, thirty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •