Base | Representation |
---|---|
bin | 10110100111010110… |
… | …11101110000000101 |
3 | 1011100011001000121202 |
4 | 23103223131300011 |
5 | 144331134234341 |
6 | 5324434352245 |
7 | 606605345651 |
oct | 132353356005 |
9 | 34304030552 |
10 | 12141321221 |
11 | 5170506377 |
12 | 242a12b685 |
13 | 11b6515353 |
14 | 8326c7a61 |
15 | 4b0d8879b |
hex | 2d3addc05 |
12141321221 has 4 divisors (see below), whose sum is σ = 12559987500. Its totient is φ = 11722654944.
The previous prime is 12141321197. The next prime is 12141321331. The reversal of 12141321221 is 12212314121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3526696996 + 8614624225 = 59386^2 + 92815^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12141321221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12141321193 and 12141321202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12141221221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209333096 + ... + 209333153.
It is an arithmetic number, because the mean of its divisors is an integer number (3139996875).
Almost surely, 212141321221 is an apocalyptic number.
It is an amenable number.
12141321221 is a deficient number, since it is larger than the sum of its proper divisors (418666279).
12141321221 is an equidigital number, since it uses as much as digits as its factorization.
12141321221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 418666278.
The product of its digits is 192, while the sum is 20.
Adding to 12141321221 its reverse (12212314121), we get a palindrome (24353635342).
The spelling of 12141321221 in words is "twelve billion, one hundred forty-one million, three hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •