Base | Representation |
---|---|
bin | 1011000110110001100110… |
… | …0000101001011011000001 |
3 | 1121020100202222110100201212 |
4 | 2301230121200221123001 |
5 | 3100031132110324301 |
6 | 41545355401135505 |
7 | 2400134313346034 |
oct | 261543140513301 |
9 | 47210688410655 |
10 | 12211020011201 |
11 | 3988734501580 |
12 | 14526b1a8a595 |
13 | 6a7656b2193b |
14 | 30303349d01b |
15 | 162983a884bb |
hex | b1b198296c1 |
12211020011201 has 16 divisors (see below), whose sum is σ = 13334762760000. Its totient is φ = 11089553832000.
The previous prime is 12211020011189. The next prime is 12211020011207. The reversal of 12211020011201 is 10211002011221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211020011201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12211020011207) 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 15 ways as a sum of consecutive naturals, for example, 205166435 + ... + 205225943.
It is an arithmetic number, because the mean of its divisors is an integer number (833422672500).
Almost surely, 212211020011201 is an apocalyptic number.
12211020011201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12211020011201 is a deficient number, since it is larger than the sum of its proper divisors (1123742748799).
12211020011201 is a wasteful number, since it uses less digits than its factorization.
12211020011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78320.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12211020011201 its reverse (10211002011221), we get a palindrome (22422022022422).
The spelling of 12211020011201 in words is "twelve trillion, two hundred eleven billion, twenty million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •