Base | Representation |
---|---|
bin | 1110001110100111000… |
… | …1001001010100001001 |
3 | 212100221110020212021211 |
4 | 3203221301021110021 |
5 | 13001103134034423 |
6 | 304143320333121 |
7 | 23442311635315 |
oct | 3435161112411 |
9 | 770843225254 |
10 | 244440143113 |
11 | 947370a7501 |
12 | 3b45a6141a1 |
13 | 1a08724b44a |
14 | bb8c256b45 |
15 | 6559b7410d |
hex | 38e9c49509 |
244440143113 has 4 divisors (see below), whose sum is σ = 250124797648. Its totient is φ = 238755488580.
The previous prime is 244440143111. The next prime is 244440143131. The reversal of 244440143113 is 311341044442.
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 244440143113 - 21 = 244440143111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (244440143111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2842327203 + ... + 2842327288.
It is an arithmetic number, because the mean of its divisors is an integer number (62531199412).
Almost surely, 2244440143113 is an apocalyptic number.
It is an amenable number.
244440143113 is a deficient number, since it is larger than the sum of its proper divisors (5684654535).
244440143113 is an equidigital number, since it uses as much as digits as its factorization.
244440143113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5684654534.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 244440143113 its reverse (311341044442), we get a palindrome (555781187555).
The spelling of 244440143113 in words is "two hundred forty-four billion, four hundred forty million, one hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •