Base | Representation |
---|---|
bin | 101001000000110111… |
… | …110100110001010101 |
3 | 11012200002100200011102 |
4 | 221000313310301111 |
5 | 1210142220030403 |
6 | 32121504115445 |
7 | 3116206144661 |
oct | 510067646125 |
9 | 135602320142 |
10 | 44038048853 |
11 | 1774936a9a7 |
12 | 8650305b85 |
13 | 41ca836696 |
14 | 21ba9c78a1 |
15 | 122b275b88 |
hex | a40df4c55 |
44038048853 has 8 divisors (see below), whose sum is σ = 45126503136. Its totient is φ = 42952518000.
The previous prime is 44038048849. The next prime is 44038048889. The reversal of 44038048853 is 35884083044.
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 44038048853 - 22 = 44038048849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 44038048798 and 44038048807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44038048823) 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 7 ways as a sum of consecutive naturals, for example, 700343 + ... + 760628.
It is an arithmetic number, because the mean of its divisors is an integer number (5640812892).
Almost surely, 244038048853 is an apocalyptic number.
44038048853 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
44038048853 is a deficient number, since it is larger than the sum of its proper divisors (1088454283).
44038048853 is a wasteful number, since it uses less digits than its factorization.
44038048853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461715.
The product of its (nonzero) digits is 1474560, while the sum is 47.
The spelling of 44038048853 in words is "forty-four billion, thirty-eight million, forty-eight thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •