Base | Representation |
---|---|
bin | 1011000110110001100011… |
… | …1010100000000001010101 |
3 | 1121020100202021122022100020 |
4 | 2301230120322200001111 |
5 | 3100031122030324341 |
6 | 41545354402535353 |
7 | 2400134132346420 |
oct | 261543072400125 |
9 | 47210667568306 |
10 | 12211010011221 |
11 | 39887298a142a |
12 | 14526aa667559 |
13 | 6a7654a300a8 |
14 | 3030320189b7 |
15 | 162982c60566 |
hex | b1b18ea0055 |
12211010011221 has 64 divisors (see below), whose sum is σ = 19148693372928. Its totient is φ = 6777147886848.
The previous prime is 12211010011049. The next prime is 12211010011223. The reversal of 12211010011221 is 12211001011221.
It is a happy number.
It is not a de Polignac number, because 12211010011221 - 238 = 11936132104277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12211010011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211010011223) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 69684511 + ... + 69859523.
It is an arithmetic number, because the mean of its divisors is an integer number (299198333952).
Almost surely, 212211010011221 is an apocalyptic number.
It is an amenable number.
12211010011221 is a deficient number, since it is larger than the sum of its proper divisors (6937683361707).
12211010011221 is a wasteful number, since it uses less digits than its factorization.
12211010011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175610.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12211010011221 its reverse (12211001011221), we get a palindrome (24422011022442).
Subtracting from 12211010011221 its reverse (12211001011221), we obtain a square (9000000 = 30002).
The spelling of 12211010011221 in words is "twelve trillion, two hundred eleven billion, ten million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •