Base | Representation |
---|---|
bin | 10000101001111000100… |
… | …110100110001100100101 |
3 | 11001102010002211212221011 |
4 | 100221320212212030211 |
5 | 122222401034401311 |
6 | 2233434034422221 |
7 | 145454253210340 |
oct | 20517046461445 |
9 | 4042102755834 |
10 | 1144484684581 |
11 | 401411849a27 |
12 | 165985731971 |
13 | 83c03001244 |
14 | 3d571515457 |
15 | 1eb8604d321 |
hex | 10a789a6325 |
1144484684581 has 4 divisors (see below), whose sum is σ = 1307982496672. Its totient is φ = 980986872492.
The previous prime is 1144484684561. The next prime is 1144484684597. The reversal of 1144484684581 is 1854864844411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1144484684581 - 225 = 1144451130149 is a prime.
It is a super-2 number, since 2×11444846845812 (a number of 25 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 (1144484684561) 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, 81748906035 + ... + 81748906048.
It is an arithmetic number, because the mean of its divisors is an integer number (326995624168).
Almost surely, 21144484684581 is an apocalyptic number.
It is an amenable number.
1144484684581 is a deficient number, since it is larger than the sum of its proper divisors (163497812091).
1144484684581 is an equidigital number, since it uses as much as digits as its factorization.
1144484684581 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163497812090.
The product of its digits is 15728640, while the sum is 58.
The spelling of 1144484684581 in words is "one trillion, one hundred forty-four billion, four hundred eighty-four million, six hundred eighty-four thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •