Base | Representation |
---|---|
bin | 101000111111011001… |
… | …001011111100100101 |
3 | 11012121100200020221202 |
4 | 220333121023330211 |
5 | 1210114342140401 |
6 | 32115220252245 |
7 | 3115455240155 |
oct | 507731137445 |
9 | 135540606852 |
10 | 44013240101 |
11 | 177363657a6 |
12 | 8643b41085 |
13 | 41c565b54c |
14 | 21b75aa765 |
15 | 1228ec506b |
hex | a3f64bf25 |
44013240101 has 4 divisors (see below), whose sum is σ = 45086733804. Its totient is φ = 42939746400.
The previous prime is 44013240097. The next prime is 44013240143. The reversal of 44013240101 is 10104231044.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8951052100 + 35062188001 = 94610^2 + 187249^2 .
It is a cyclic number.
It is not a de Polignac number, because 44013240101 - 22 = 44013240097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44013240181) 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, 536746790 + ... + 536746871.
It is an arithmetic number, because the mean of its divisors is an integer number (11271683451).
Almost surely, 244013240101 is an apocalyptic number.
44013240101 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
44013240101 is a deficient number, since it is larger than the sum of its proper divisors (1073493703).
44013240101 is a wasteful number, since it uses less digits than its factorization.
44013240101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073493702.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 44013240101 its reverse (10104231044), we get a palindrome (54117471145).
The spelling of 44013240101 in words is "forty-four billion, thirteen million, two hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •