Base | Representation |
---|---|
bin | 10110101111100110… |
… | …10000110111011101 |
3 | 1011111222011101000212 |
4 | 23113303100313131 |
5 | 200001340140321 |
6 | 5335344502205 |
7 | 611405214623 |
oct | 132763206735 |
9 | 34458141025 |
10 | 12210474461 |
11 | 51a6549209 |
12 | 244931a965 |
13 | 11c7948623 |
14 | 83b969513 |
15 | 4b6e9855b |
hex | 2d7cd0ddd |
12210474461 has 4 divisors (see below), whose sum is σ = 12240924924. Its totient is φ = 12180024000.
The previous prime is 12210474449. The next prime is 12210474467. The reversal of 12210474461 is 16447401221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16447401221 = 103 ⋅159683507.
It can be written as a sum of positive squares in 2 ways, for example, as 5825505625 + 6384968836 = 76325^2 + 79906^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210474461 - 218 = 12210212317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210474467) 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, 15224630 + ... + 15225431.
It is an arithmetic number, because the mean of its divisors is an integer number (3060231231).
Almost surely, 212210474461 is an apocalyptic number.
It is an amenable number.
12210474461 is a deficient number, since it is larger than the sum of its proper divisors (30450463).
12210474461 is an equidigital number, since it uses as much as digits as its factorization.
12210474461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30450462.
The product of its (nonzero) digits is 10752, while the sum is 32.
Adding to 12210474461 its reverse (16447401221), we get a palindrome (28657875682).
The spelling of 12210474461 in words is "twelve billion, two hundred ten million, four hundred seventy-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •