Base | Representation |
---|---|
bin | 110111100011101110011111… |
… | …000001111001100100110111 |
3 | 1012001011102000000210020010001 |
4 | 313203232133001321210313 |
5 | 224011342443020341210 |
6 | 2223403432323412131 |
7 | 102316351421105521 |
oct | 6743563701714467 |
9 | 1161142000706101 |
10 | 244347652512055 |
11 | 70947291792954 |
12 | 234a4266524047 |
13 | a645b66a8c661 |
14 | 444a6bd200a11 |
15 | 1d3b09ab6803a |
hex | de3b9f079937 |
244347652512055 has 8 divisors (see below), whose sum is σ = 305965756189152. Its totient is φ = 186979073226528.
The previous prime is 244347652512031. The next prime is 244347652512071. The reversal of 244347652512055 is 550215256743442.
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 244347652512055 - 219 = 244347651987767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244347652511987 and 244347652512005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1062381097764 + ... + 1062381097993.
It is an arithmetic number, because the mean of its divisors is an integer number (38245719523644).
Almost surely, 2244347652512055 is an apocalyptic number.
244347652512055 is a deficient number, since it is larger than the sum of its proper divisors (61618103677097).
244347652512055 is a wasteful number, since it uses less digits than its factorization.
244347652512055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2124762195785.
The product of its (nonzero) digits is 40320000, while the sum is 55.
The spelling of 244347652512055 in words is "two hundred forty-four trillion, three hundred forty-seven billion, six hundred fifty-two million, five hundred twelve thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •