Base | Representation |
---|---|
bin | 10100000011110111101011… |
… | …00101010110111100001011 |
3 | 12210012012111002100021222101 |
4 | 22001323311211112330023 |
5 | 21240223303142404011 |
6 | 233453233145534231 |
7 | 12202043012043511 |
oct | 1201736545267413 |
9 | 183165432307871 |
10 | 44113434341131 |
11 | 13068447718101 |
12 | 4b4558baa4377 |
13 | 1b7cb5724aabc |
14 | ac715cb884b1 |
15 | 51775955c2c1 |
hex | 281ef5956f0b |
44113434341131 has 4 divisors (see below), whose sum is σ = 44122402314000. Its totient is φ = 44104466368264.
The previous prime is 44113434341107. The next prime is 44113434341167. The reversal of 44113434341131 is 13114343431144.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-44113434341131 is a prime.
It is a super-2 number, since 2×441134343411312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (44113434341101) 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, 4483979056 + ... + 4483988893.
It is an arithmetic number, because the mean of its divisors is an integer number (11030600578500).
Almost surely, 244113434341131 is an apocalyptic number.
44113434341131 is a deficient number, since it is larger than the sum of its proper divisors (8967972869).
44113434341131 is an equidigital number, since it uses as much as digits as its factorization.
44113434341131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8967972868.
The product of its digits is 82944, while the sum is 37.
Adding to 44113434341131 its reverse (13114343431144), we get a palindrome (57227777772275).
The spelling of 44113434341131 in words is "forty-four trillion, one hundred thirteen billion, four hundred thirty-four million, three hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •