Base | Representation |
---|---|
bin | 10110110001011101… |
… | …11011001011010101 |
3 | 1011120001120221210201 |
4 | 23120232323023111 |
5 | 200014341124021 |
6 | 5341104020501 |
7 | 611655153664 |
oct | 133056731325 |
9 | 34501527721 |
10 | 12226114261 |
11 | 5204360669 |
12 | 2452601731 |
13 | 11cac6324a |
14 | 83da7addb |
15 | 4b8537591 |
hex | 2d8bbb2d5 |
12226114261 has 4 divisors (see below), whose sum is σ = 12232643692. Its totient is φ = 12219584832.
The previous prime is 12226114249. The next prime is 12226114279. The reversal of 12226114261 is 16241162221.
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 3388986225 + 8837128036 = 58215^2 + 94006^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12226114261 is a prime.
It is a super-2 number, since 2×122261142612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12226144261) 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, 3261906 + ... + 3265651.
It is an arithmetic number, because the mean of its divisors is an integer number (3058160923).
Almost surely, 212226114261 is an apocalyptic number.
It is an amenable number.
12226114261 is a deficient number, since it is larger than the sum of its proper divisors (6529431).
12226114261 is an equidigital number, since it uses as much as digits as its factorization.
12226114261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6529430.
The product of its digits is 2304, while the sum is 28.
Adding to 12226114261 its reverse (16241162221), we get a palindrome (28467276482).
The spelling of 12226114261 in words is "twelve billion, two hundred twenty-six million, one hundred fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •