Base | Representation |
---|---|
bin | 10100010100010011011000… |
… | …00001000111001011100000 |
3 | 12212012011212221222110200221 |
4 | 22022021230001013023200 |
5 | 21324001132340400442 |
6 | 235004452433052424 |
7 | 12260612012243455 |
oct | 1212115401071340 |
9 | 185164787873627 |
10 | 44678062043872 |
11 | 132659502a6184 |
12 | 5016aa86b7114 |
13 | 1bc117a7c24aa |
14 | b066032cd82c |
15 | 5272a3d09467 |
hex | 28a26c0472e0 |
44678062043872 has 24 divisors (see below), whose sum is σ = 88128118113336. Its totient is φ = 22296317761152.
The previous prime is 44678062043843. The next prime is 44678062043873. The reversal of 44678062043872 is 27834026087644.
It is a super-2 number, since 2×446780620438722 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 44678062043872.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44678062043873) 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, 1334772403 + ... + 1334805874.
It is an arithmetic number, because the mean of its divisors is an integer number (3672004921389).
Almost surely, 244678062043872 is an apocalyptic number.
It is an amenable number.
44678062043872 is a deficient number, since it is larger than the sum of its proper divisors (43450056069464).
44678062043872 is a wasteful number, since it uses less digits than its factorization.
44678062043872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2669578810 (or 2669578802 counting only the distinct ones).
The product of its (nonzero) digits is 86704128, while the sum is 61.
The spelling of 44678062043872 in words is "forty-four trillion, six hundred seventy-eight billion, sixty-two million, forty-three thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •