Base | Representation |
---|---|
bin | 1010100000111… |
… | …0010111110001 |
3 | 10001222110112102 |
4 | 2220032113301 |
5 | 42242132212 |
6 | 4213110145 |
7 | 1043556452 |
oct | 250162761 |
9 | 101873472 |
10 | 44099057 |
11 | 22990302 |
12 | 12928355 |
13 | 91a0522 |
14 | 5bdd129 |
15 | 3d115c2 |
hex | 2a0e5f1 |
44099057 has 4 divisors (see below), whose sum is σ = 46420080. Its totient is φ = 41778036.
The previous prime is 44099047. The next prime is 44099059. The reversal of 44099057 is 75099044.
44099057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 44099057 - 28 = 44098801 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 44099057.
It is not an unprimeable number, because it can be changed into a prime (44099059) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1160483 + ... + 1160520.
It is an arithmetic number, because the mean of its divisors is an integer number (11605020).
Almost surely, 244099057 is an apocalyptic number.
It is an amenable number.
44099057 is a deficient number, since it is larger than the sum of its proper divisors (2321023).
44099057 is a wasteful number, since it uses less digits than its factorization.
44099057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2321022.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 44099057 is about 6640.7120853113. The cubic root of 44099057 is about 353.2995635421.
The spelling of 44099057 in words is "forty-four million, ninety-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •