Base | Representation |
---|---|
bin | 1011000001000110110000… |
… | …1001111010111100111011 |
3 | 1120220001101011111201221100 |
4 | 2300101230021322330323 |
5 | 3041432144303033221 |
6 | 41432530554342443 |
7 | 2360115565524363 |
oct | 260215411727473 |
9 | 46801334451840 |
10 | 12113622314811 |
11 | 39503a3aa4716 |
12 | 143784b72aa23 |
13 | 69b4044b0824 |
14 | 2dc433cbd9a3 |
15 | 160183036926 |
hex | b046c27af3b |
12113622314811 has 12 divisors (see below), whose sum is σ = 17498811119400. Its totient is φ = 8075122056960.
The previous prime is 12113622314809. The next prime is 12113622314921. The reversal of 12113622314811 is 11841322631121.
12113622314811 is a `hidden beast` number, since 1 + 2 + 1 + 1 + 3 + 622 + 3 + 14 + 8 + 11 = 666.
It is not a de Polignac number, because 12113622314811 - 21 = 12113622314809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12113622314411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52056870 + ... + 52289051.
It is an arithmetic number, because the mean of its divisors is an integer number (1458234259950).
Almost surely, 212113622314811 is an apocalyptic number.
12113622314811 is a deficient number, since it is larger than the sum of its proper divisors (5385188804589).
12113622314811 is a wasteful number, since it uses less digits than its factorization.
12113622314811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104358826 (or 104358823 counting only the distinct ones).
The product of its digits is 13824, while the sum is 36.
Adding to 12113622314811 its reverse (11841322631121), we get a palindrome (23954944945932).
The spelling of 12113622314811 in words is "twelve trillion, one hundred thirteen billion, six hundred twenty-two million, three hundred fourteen thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •