Base | Representation |
---|---|
bin | 10110101111101101… |
… | …11000011101000001 |
3 | 1011112000221120020110 |
4 | 23113312320131001 |
5 | 200002111014131 |
6 | 5335421101533 |
7 | 611416245306 |
oct | 132766703501 |
9 | 34460846213 |
10 | 12211423041 |
11 | 51a7036964 |
12 | 24496b78a9 |
13 | 11c7bbb30c |
14 | 83bb350ad |
15 | 4b70d4646 |
hex | 2d7db8741 |
12211423041 has 4 divisors (see below), whose sum is σ = 16281897392. Its totient is φ = 8140948692.
The previous prime is 12211423033. The next prime is 12211423061. The reversal of 12211423041 is 14032411221.
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 not a de Polignac number, because 12211423041 - 23 = 12211423033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12211422999 and 12211423017.
It is not an unprimeable number, because it can be changed into a prime (12211423031) 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, 2035237171 + ... + 2035237176.
It is an arithmetic number, because the mean of its divisors is an integer number (4070474348).
Almost surely, 212211423041 is an apocalyptic number.
It is an amenable number.
12211423041 is a deficient number, since it is larger than the sum of its proper divisors (4070474351).
12211423041 is an equidigital number, since it uses as much as digits as its factorization.
12211423041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4070474350.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 12211423041 its reverse (14032411221), we get a palindrome (26243834262).
The spelling of 12211423041 in words is "twelve billion, two hundred eleven million, four hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •