Base | Representation |
---|---|
bin | 101001010001011110… |
… | …011011010010010110 |
3 | 11020101111111201100202 |
4 | 221101132123102112 |
5 | 1211230022303132 |
6 | 32205254340502 |
7 | 3126130625531 |
oct | 512136332226 |
9 | 136344451322 |
10 | 44316603542 |
11 | 17881627192 |
12 | 870965a732 |
13 | 4243466243 |
14 | 22059b7a18 |
15 | 124594a762 |
hex | a5179b496 |
44316603542 has 8 divisors (see below), whose sum is σ = 69973584600. Its totient is φ = 20992075344.
The previous prime is 44316603511. The next prime is 44316603559. The reversal of 44316603542 is 24530661344.
44316603542 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×443166035422 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 1166226409 = 44316603542 / (4 + 4 + 3 + 1 + 6 + 6 + 0 + 3 + 5 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 44316603496 and 44316603505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 583113167 + ... + 583113242.
It is an arithmetic number, because the mean of its divisors is an integer number (8746698075).
Almost surely, 244316603542 is an apocalyptic number.
44316603542 is a deficient number, since it is larger than the sum of its proper divisors (25656981058).
44316603542 is a wasteful number, since it uses less digits than its factorization.
44316603542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1166226430.
The product of its (nonzero) digits is 207360, while the sum is 38.
The spelling of 44316603542 in words is "forty-four billion, three hundred sixteen million, six hundred three thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •