Base | Representation |
---|---|
bin | 10100001110100100011010… |
… | …11111000100000110111101 |
3 | 12211111100101012120011011220 |
4 | 22013102031133010012331 |
5 | 21312234200043020000 |
6 | 234334151541303553 |
7 | 12240436003354413 |
oct | 1207221537040675 |
9 | 184440335504156 |
10 | 44481055048125 |
11 | 1319a344a57413 |
12 | 4ba4887404bb9 |
13 | 1ba87125a8567 |
14 | adac749132b3 |
15 | 5220c34e61a0 |
hex | 28748d7c41bd |
44481055048125 has 80 divisors (see below), whose sum is σ = 75129810864768. Its totient is φ = 23399010400000.
The previous prime is 44481055048121. The next prime is 44481055048127. The reversal of 44481055048125 is 52184055018444.
44481055048125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 44481055048125 - 22 = 44481055048121 is a prime.
It is a super-3 number, since 3×444810550481253 (a number of 42 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44481055048121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 49359079 + ... + 50252171.
Almost surely, 244481055048125 is an apocalyptic number.
It is an amenable number.
44481055048125 is a deficient number, since it is larger than the sum of its proper divisors (30648755816643).
44481055048125 is a wasteful number, since it uses less digits than its factorization.
44481055048125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893480 (or 893465 counting only the distinct ones).
The product of its (nonzero) digits is 4096000, while the sum is 51.
The spelling of 44481055048125 in words is "forty-four trillion, four hundred eighty-one billion, fifty-five million, forty-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •