Base | Representation |
---|---|
bin | 10100000001110011100011… |
… | …00100110011001100111101 |
3 | 12202221102101120002210011220 |
4 | 22000321301210303030331 |
5 | 21233043020013004001 |
6 | 233400502323303553 |
7 | 12163652132131233 |
oct | 1200716144631475 |
9 | 182842346083156 |
10 | 44042500125501 |
11 | 13040357153aa9 |
12 | 4b3389421abb9 |
13 | 1b762613ba047 |
14 | ac395006a953 |
15 | 5159a6e11c36 |
hex | 280e7193333d |
44042500125501 has 4 divisors (see below), whose sum is σ = 58723333500672. Its totient is φ = 29361666750332.
The previous prime is 44042500125493. The next prime is 44042500125521. The reversal of 44042500125501 is 10552100524044.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 44042500125501 - 23 = 44042500125493 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44042500125521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7340416687581 + ... + 7340416687586.
It is an arithmetic number, because the mean of its divisors is an integer number (14680833375168).
Almost surely, 244042500125501 is an apocalyptic number.
It is an amenable number.
44042500125501 is a deficient number, since it is larger than the sum of its proper divisors (14680833375171).
44042500125501 is a wasteful number, since it uses less digits than its factorization.
44042500125501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14680833375170.
The product of its (nonzero) digits is 32000, while the sum is 33.
Adding to 44042500125501 its reverse (10552100524044), we get a palindrome (54594600649545).
The spelling of 44042500125501 in words is "forty-four trillion, forty-two billion, five hundred million, one hundred twenty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •