Base | Representation |
---|---|
bin | 101001010010111011… |
… | …100100101011011001 |
3 | 11020110012110021100220 |
4 | 221102323210223121 |
5 | 1211302300141101 |
6 | 32211525550253 |
7 | 3126545314605 |
oct | 512273445331 |
9 | 136405407326 |
10 | 44341021401 |
11 | 17894394736 |
12 | 8715875389 |
13 | 4248535491 |
14 | 2208d32505 |
15 | 1247b70636 |
hex | a52ee4ad9 |
44341021401 has 4 divisors (see below), whose sum is σ = 59121361872. Its totient is φ = 29560680932.
The previous prime is 44341021391. The next prime is 44341021423. The reversal of 44341021401 is 10412014344.
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 44341021401 - 25 = 44341021369 is a prime.
It is a super-2 number, since 2×443410214012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (44341021441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7390170231 + ... + 7390170236.
It is an arithmetic number, because the mean of its divisors is an integer number (14780340468).
Almost surely, 244341021401 is an apocalyptic number.
It is an amenable number.
44341021401 is a deficient number, since it is larger than the sum of its proper divisors (14780340471).
44341021401 is a wasteful number, since it uses less digits than its factorization.
44341021401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14780340470.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 44341021401 its reverse (10412014344), we get a palindrome (54753035745).
The spelling of 44341021401 in words is "forty-four billion, three hundred forty-one million, twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •