Base | Representation |
---|---|
bin | 101001001000100000… |
… | …010100100000011001 |
3 | 11020000000022121022212 |
4 | 221020200110200121 |
5 | 1210423010330423 |
6 | 32142320524505 |
7 | 3122322461564 |
oct | 511040244031 |
9 | 136000277285 |
10 | 44166105113 |
11 | 17804684519 |
12 | 8687180735 |
13 | 421b221510 |
14 | 21cd9dd4db |
15 | 123761d578 |
hex | a48814819 |
44166105113 has 8 divisors (see below), whose sum is σ = 47682115656. Its totient is φ = 40667040000.
The previous prime is 44166105101. The next prime is 44166105187. The reversal of 44166105113 is 31150166144.
It can be written as a sum of positive squares in 4 ways, for example, as 5572323904 + 38593781209 = 74648^2 + 196453^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 44166105113 - 210 = 44166104089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 44166105113.
It is not an unprimeable number, because it can be changed into a prime (44166105713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4230938 + ... + 4241363.
It is an arithmetic number, because the mean of its divisors is an integer number (5960264457).
Almost surely, 244166105113 is an apocalyptic number.
It is an amenable number.
44166105113 is a deficient number, since it is larger than the sum of its proper divisors (3516010543).
44166105113 is a wasteful number, since it uses less digits than its factorization.
44166105113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8472715.
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 44166105113 in words is "forty-four billion, one hundred sixty-six million, one hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •