Base | Representation |
---|---|
bin | 1011000001011110111011… |
… | …1110001001011111010101 |
3 | 1120220200010110000110210122 |
4 | 2300113232332021133111 |
5 | 3042033442133324341 |
6 | 41435522543201325 |
7 | 2360435450164154 |
oct | 260275676113725 |
9 | 46820113013718 |
10 | 12120112011221 |
11 | 3953124294685 |
12 | 1438b60ba6245 |
13 | 69bbc9b64886 |
14 | 2dc88bb6159b |
15 | 160412b4e94b |
hex | b05eef897d5 |
12120112011221 has 8 divisors (see below), whose sum is σ = 12378327859584. Its totient is φ = 11861910376480.
The previous prime is 12120112011151. The next prime is 12120112011251. The reversal of 12120112011221 is 12211021102121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-12120112011221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12120112011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120112011251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1820915 + ... + 5249376.
It is an arithmetic number, because the mean of its divisors is an integer number (1547290982448).
Almost surely, 212120112011221 is an apocalyptic number.
It is an amenable number.
12120112011221 is a deficient number, since it is larger than the sum of its proper divisors (258215848363).
12120112011221 is an equidigital number, since it uses as much as digits as its factorization.
12120112011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7106811.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12120112011221 its reverse (12211021102121), we get a palindrome (24331133113342).
The spelling of 12120112011221 in words is "twelve trillion, one hundred twenty billion, one hundred twelve million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •