Base | Representation |
---|---|
bin | 1011111101000110100000… |
… | …0001110010000000101011 |
3 | 1201112120212000111121200200 |
4 | 2333101220001302000223 |
5 | 3210324104334120321 |
6 | 43542232343403243 |
7 | 2524435061635056 |
oct | 277215001620053 |
9 | 51476760447620 |
10 | 13144345223211 |
11 | 420853822a3a4 |
12 | 1583566753523 |
13 | 7446778419b7 |
14 | 33629278da9d |
15 | 17bdabac1d26 |
hex | bf46807202b |
13144345223211 has 36 divisors (see below), whose sum is σ = 19664554910520. Its totient is φ = 8460296208000.
The previous prime is 13144345223203. The next prime is 13144345223231. The reversal of 13144345223211 is 11232254344131.
13144345223211 is a `hidden beast` number, since 1 + 3 + 1 + 4 + 434 + 5 + 2 + 2 + 3 + 211 = 666.
It is not a de Polignac number, because 13144345223211 - 23 = 13144345223203 is a prime.
It is a super-2 number, since 2×131443452232112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13144345223231) 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 35 ways as a sum of consecutive naturals, for example, 221371135 + ... + 221430503.
Almost surely, 213144345223211 is an apocalyptic number.
13144345223211 is a deficient number, since it is larger than the sum of its proper divisors (6520209687309).
13144345223211 is a wasteful number, since it uses less digits than its factorization.
13144345223211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88684 (or 88652 counting only the distinct ones).
The product of its digits is 69120, while the sum is 36.
Adding to 13144345223211 its reverse (11232254344131), we get a palindrome (24376599567342).
The spelling of 13144345223211 in words is "thirteen trillion, one hundred forty-four billion, three hundred forty-five million, two hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •