Base | Representation |
---|---|
bin | 10000101001110000000… |
… | …011010010011111101001 |
3 | 11001101202002212200100000 |
4 | 100221300003102133221 |
5 | 122222102322223423 |
6 | 2233411511333213 |
7 | 145450561542342 |
oct | 20516003223751 |
9 | 4041662780300 |
10 | 1144341211113 |
11 | 401348865211 |
12 | 165945681209 |
13 | 83bac378bb9 |
14 | 3d55a4490c9 |
15 | 1eb7865c843 |
hex | 10a700d27e9 |
1144341211113 has 48 divisors (see below), whose sum is σ = 1835383717440. Its totient is φ = 709950168576.
The previous prime is 1144341211109. The next prime is 1144341211133. The reversal of 1144341211113 is 3111121434411.
1144341211113 is a `hidden beast` number, since 1 + 1 + 4 + 434 + 1 + 211 + 1 + 13 = 666.
It is not a de Polignac number, because 1144341211113 - 22 = 1144341211109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1144341211133) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1188595 + ... + 1923912.
It is an arithmetic number, because the mean of its divisors is an integer number (38237160780).
Almost surely, 21144341211113 is an apocalyptic number.
It is an amenable number.
1144341211113 is a deficient number, since it is larger than the sum of its proper divisors (691042506327).
1144341211113 is an equidigital number, since it uses as much as digits as its factorization.
1144341211113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3112628 (or 3112616 counting only the distinct ones).
The product of its digits is 1152, while the sum is 27.
Adding to 1144341211113 its reverse (3111121434411), we get a palindrome (4255462645524).
The spelling of 1144341211113 in words is "one trillion, one hundred forty-four billion, three hundred forty-one million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •