Base | Representation |
---|---|
bin | 110111100100111111010010… |
… | …111001010100000100001101 |
3 | 1012001110200222010221001112212 |
4 | 313210333102321110010031 |
5 | 224014303144014204123 |
6 | 2223511342343240205 |
7 | 102325542562554110 |
oct | 6744772271240415 |
9 | 1161420863831485 |
10 | 244434422022413 |
11 | 70980068926297 |
12 | 234b9041449065 |
13 | a6510b45292ac |
14 | 4450991058577 |
15 | 1d3d4785c2878 |
hex | de4fd2e5410d |
244434422022413 has 16 divisors (see below), whose sum is σ = 294109884088320. Its totient is φ = 198452032427376.
The previous prime is 244434422022389. The next prime is 244434422022431. The reversal of 244434422022413 is 314220224434442.
It is not a de Polignac number, because 244434422022413 - 28 = 244434422022157 is a prime.
It is a super-2 number, since 2×2444344220224132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244434422022443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166254545 + ... + 167718342.
It is an arithmetic number, because the mean of its divisors is an integer number (18381867755520).
Almost surely, 2244434422022413 is an apocalyptic number.
It is an amenable number.
244434422022413 is a deficient number, since it is larger than the sum of its proper divisors (49675462065907).
244434422022413 is a wasteful number, since it uses less digits than its factorization.
244434422022413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333978416.
The product of its (nonzero) digits is 1179648, while the sum is 41.
Adding to 244434422022413 its reverse (314220224434442), we get a palindrome (558654646456855).
The spelling of 244434422022413 in words is "two hundred forty-four trillion, four hundred thirty-four billion, four hundred twenty-two million, twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •