Base | Representation |
---|---|
bin | 101001000101010010… |
… | …000000101001010101 |
3 | 11012212020112220101100 |
4 | 221011102000221111 |
5 | 1210320134201401 |
6 | 32133105420313 |
7 | 3121065000300 |
oct | 510522005125 |
9 | 135766486340 |
10 | 44112022101 |
11 | 177870a5114 |
12 | 867103a699 |
13 | 420cc66834 |
14 | 21c6761b37 |
15 | 12329d8b86 |
hex | a45480a55 |
44112022101 has 72 divisors (see below), whose sum is σ = 75021021504. Its totient is φ = 24902035200.
The previous prime is 44112021997. The next prime is 44112022117. The reversal of 44112022101 is 10122021144.
44112022101 is a `hidden beast` number, since 441 + 1 + 2 + 0 + 221 + 0 + 1 = 666.
It is not a de Polignac number, because 44112022101 - 218 = 44111759957 is a prime.
It is a super-2 number, since 2×441120221012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44112021101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 17290776 + ... + 17293326.
It is an arithmetic number, because the mean of its divisors is an integer number (1041958632).
Almost surely, 244112022101 is an apocalyptic number.
It is an amenable number.
44112022101 is a deficient number, since it is larger than the sum of its proper divisors (30908999403).
44112022101 is a wasteful number, since it uses less digits than its factorization.
44112022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3031 (or 3021 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 44112022101 its reverse (10122021144), we get a palindrome (54234043245).
The spelling of 44112022101 in words is "forty-four billion, one hundred twelve million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •