Base | Representation |
---|---|
bin | 1110001101011001001… |
… | …0000010011000001011 |
3 | 212100002200002111122021 |
4 | 3203112102002120023 |
5 | 12444420441034011 |
6 | 304051041305311 |
7 | 23431232100103 |
oct | 3432622023013 |
9 | 770080074567 |
10 | 244113221131 |
11 | 9458960514a |
12 | 3b389035237 |
13 | 1a0345b56a0 |
14 | bb5aa76203 |
15 | 653b0e8471 |
hex | 38d648260b |
244113221131 has 8 divisors (see below), whose sum is σ = 278355347424. Its totient is φ = 212080264320.
The previous prime is 244113221101. The next prime is 244113221137. The reversal of 244113221131 is 131122311442.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 244113221131 - 229 = 243576350219 is a prime.
It is a super-2 number, since 2×2441132211312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244113221096 and 244113221105.
It is not an unprimeable number, because it can be changed into a prime (244113221137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 552292135 + ... + 552292576.
It is an arithmetic number, because the mean of its divisors is an integer number (34794418428).
Almost surely, 2244113221131 is an apocalyptic number.
244113221131 is a deficient number, since it is larger than the sum of its proper divisors (34242126293).
244113221131 is a wasteful number, since it uses less digits than its factorization.
244113221131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1104584741.
The product of its digits is 1152, while the sum is 25.
Adding to 244113221131 its reverse (131122311442), we get a palindrome (375235532573).
The spelling of 244113221131 in words is "two hundred forty-four billion, one hundred thirteen million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •