Base | Representation |
---|---|
bin | 10110101111100011… |
… | …00111000110000111 |
3 | 1011111221100100202000 |
4 | 23113301213012013 |
5 | 200001232304343 |
6 | 5335331320343 |
7 | 611401431552 |
oct | 132761470607 |
9 | 34457310660 |
10 | 12210041223 |
11 | 51a6282766 |
12 | 24491500b3 |
13 | 11c7826383 |
14 | 83b895699 |
15 | 4b6e0eed3 |
hex | 2d7c67187 |
12210041223 has 32 divisors (see below), whose sum is σ = 19165363200. Its totient is φ = 7656259968.
The previous prime is 12210041219. The next prime is 12210041227. The reversal of 12210041223 is 32214001221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12210041219) and next prime (12210041227).
It is not a de Polignac number, because 12210041223 - 22 = 12210041219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12210041196 and 12210041205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210041227) 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 31 ways as a sum of consecutive naturals, for example, 783138 + ... + 798576.
It is an arithmetic number, because the mean of its divisors is an integer number (598917600).
Almost surely, 212210041223 is an apocalyptic number.
12210041223 is a deficient number, since it is larger than the sum of its proper divisors (6955321977).
12210041223 is a wasteful number, since it uses less digits than its factorization.
12210041223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17188 (or 17182 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 12210041223 its reverse (32214001221), we get a palindrome (44424042444).
The spelling of 12210041223 in words is "twelve billion, two hundred ten million, forty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •