Base | Representation |
---|---|
bin | 110010000001110101000111… |
… | …0000000010100001111000101 |
3 | 2010201002221211010122000021201 |
4 | 1210003222032000110033011 |
5 | 430134334434231124000 |
6 | 4155531000045542501 |
7 | 161456002264156363 |
oct | 14403521600241705 |
9 | 2121087733560251 |
10 | 440056141661125 |
11 | 118240841800710 |
12 | 414319b3574a31 |
13 | 15b711680c0432 |
14 | 7a94b8bdba633 |
15 | 35d1d0b9ab96a |
hex | 1903a8e0143c5 |
440056141661125 has 32 divisors (see below), whose sum is σ = 607323508900992. Its totient is φ = 315656709264000.
The previous prime is 440056141661117. The next prime is 440056141661173. The reversal of 440056141661125 is 521166141650044.
It is not a de Polignac number, because 440056141661125 - 23 = 440056141661117 is a prime.
It is a super-2 number, since 2×4400561416611252 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2191960107 + ... + 2192160856.
It is an arithmetic number, because the mean of its divisors is an integer number (18978859653156).
Almost surely, 2440056141661125 is an apocalyptic number.
It is an amenable number.
440056141661125 is a deficient number, since it is larger than the sum of its proper divisors (167267367239867).
440056141661125 is a wasteful number, since it uses less digits than its factorization.
440056141661125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4384121062 (or 4384121052 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 46.
The spelling of 440056141661125 in words is "four hundred forty trillion, fifty-six billion, one hundred forty-one million, six hundred sixty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •