Base | Representation |
---|---|
bin | 10100000001010011001101… |
… | …11001001100001001100000 |
3 | 12202212202120202221111000201 |
4 | 22000221212321030021200 |
5 | 21232301442102131000 |
6 | 233344512014154544 |
7 | 12162466015342423 |
oct | 1200514671141140 |
9 | 182782522844021 |
10 | 44025141052000 |
11 | 13033a59433169 |
12 | 4b3044a7b2a54 |
13 | 1b74725bb4814 |
14 | ac2b847db9ba |
15 | 5152dce5c96a |
hex | 280a66e4c260 |
44025141052000 has 96 divisors (see below), whose sum is σ = 109651549984704. Its totient is φ = 17368822656000.
The previous prime is 44025141051943. The next prime is 44025141052037. The reversal of 44025141052000 is 25014152044.
It is a self number, because there is not a number n which added to its sum of digits gives 44025141052000.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 75093516 + ... + 75677515.
It is an arithmetic number, because the mean of its divisors is an integer number (1142203645674).
Almost surely, 244025141052000 is an apocalyptic number.
44025141052000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
44025141052000 is an abundant number, since it is smaller than the sum of its proper divisors (65626408932704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44025141052000 is a wasteful number, since it uses less digits than its factorization.
44025141052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150771129 (or 150771111 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 28.
The spelling of 44025141052000 in words is "forty-four trillion, twenty-five billion, one hundred forty-one million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •