Base | Representation |
---|---|
bin | 10000101001011110001… |
… | …000010000101100111001 |
3 | 11001100222011002012222112 |
4 | 100221132020100230321 |
5 | 122220443333241401 |
6 | 2233322010502105 |
7 | 145440251003312 |
oct | 20513610205471 |
9 | 4040864065875 |
10 | 1144040524601 |
11 | 401204061a67 |
12 | 165880a34935 |
13 | 83b61c9a7a0 |
14 | 3d52c537609 |
15 | 1eb5c0653bb |
hex | 10a5e210b39 |
1144040524601 has 4 divisors (see below), whose sum is σ = 1232043641892. Its totient is φ = 1056037407312.
The previous prime is 1144040524573. The next prime is 1144040524603. The reversal of 1144040524601 is 1064250404411.
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 120392344576 + 1023648180025 = 346976^2 + 1011755^2 .
It is a cyclic number.
It is not a de Polignac number, because 1144040524601 - 26 = 1144040524537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1144040524603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44001558626 + ... + 44001558651.
It is an arithmetic number, because the mean of its divisors is an integer number (308010910473).
Almost surely, 21144040524601 is an apocalyptic number.
It is an amenable number.
1144040524601 is a deficient number, since it is larger than the sum of its proper divisors (88003117291).
1144040524601 is an equidigital number, since it uses as much as digits as its factorization.
1144040524601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88003117290.
The product of its (nonzero) digits is 15360, while the sum is 32.
The spelling of 1144040524601 in words is "one trillion, one hundred forty-four billion, forty million, five hundred twenty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •