Base | Representation |
---|---|
bin | 10110110011010000… |
… | …10100111111101001 |
3 | 1011121002220110201102 |
4 | 23121220110333221 |
5 | 200032214142332 |
6 | 5342402331145 |
7 | 612230106404 |
oct | 133150247751 |
9 | 34532813642 |
10 | 12241162217 |
11 | 52118a9399 |
12 | 2457659ab5 |
13 | 120110166b |
14 | 841a76d3b |
15 | 4b9a0b062 |
hex | 2d9a14fe9 |
12241162217 has 4 divisors (see below), whose sum is σ = 12241399296. Its totient is φ = 12240925140.
The previous prime is 12241162211. The next prime is 12241162229. The reversal of 12241162217 is 71226114221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12241162217 - 24 = 12241162201 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 12241162217.
It is not an unprimeable number, because it can be changed into a prime (12241162211) 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 3 ways as a sum of consecutive naturals, for example, 4553 + ... + 156534.
It is an arithmetic number, because the mean of its divisors is an integer number (3060349824).
Almost surely, 212241162217 is an apocalyptic number.
It is an amenable number.
12241162217 is a deficient number, since it is larger than the sum of its proper divisors (237079).
12241162217 is an equidigital number, since it uses as much as digits as its factorization.
12241162217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237078.
The product of its digits is 2688, while the sum is 29.
Adding to 12241162217 its reverse (71226114221), we get a palindrome (83467276438).
The spelling of 12241162217 in words is "twelve billion, two hundred forty-one million, one hundred sixty-two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •