Base | Representation |
---|---|
bin | 101001000010010000… |
… | …011000111111000000 |
3 | 11012201201001012220102 |
4 | 221002100120333000 |
5 | 1210214141001411 |
6 | 32124053501532 |
7 | 3116610403016 |
oct | 510220307700 |
9 | 135651035812 |
10 | 44061265856 |
11 | 17760488203 |
12 | 86580418a8 |
13 | 42025a515a |
14 | 21bdb0c8b6 |
15 | 122d30ed3b |
hex | a42418fc0 |
44061265856 has 112 divisors (see below), whose sum is σ = 93487597632. Its totient is φ = 20532019200.
The previous prime is 44061265849. The next prime is 44061265883. The reversal of 44061265856 is 65856216044.
It is a super-2 number, since 2×440612658562 (a number of 22 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 44061265856.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66658166 + ... + 66658826.
Almost surely, 244061265856 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 44061265856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46743798816).
44061265856 is an abundant number, since it is smaller than the sum of its proper divisors (49426331776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44061265856 is a wasteful number, since it uses less digits than its factorization.
44061265856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1198 (or 1188 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 47.
The spelling of 44061265856 in words is "forty-four billion, sixty-one million, two hundred sixty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •