Base | Representation |
---|---|
bin | 110111100101111101101000… |
… | …010111001011000001110101 |
3 | 1012001201002201202120011022102 |
4 | 313211331220113023001311 |
5 | 224021402233131224331 |
6 | 2224002212123311445 |
7 | 102333432325435121 |
oct | 6745755027130165 |
9 | 1161632652504272 |
10 | 244501354164341 |
11 | 709a649531a16a |
12 | 2350a00097b585 |
13 | a6574c01c07c1 |
14 | 4453d00442581 |
15 | 1d400946d84cb |
hex | de5f685cb075 |
244501354164341 has 4 divisors (see below), whose sum is σ = 257369846488800. Its totient is φ = 231632861839884.
The previous prime is 244501354164313. The next prime is 244501354164367. The reversal of 244501354164341 is 143461453105442.
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 244501354164341 - 226 = 244501287055477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244501354164841) 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, 6434246162201 + ... + 6434246162238.
It is an arithmetic number, because the mean of its divisors is an integer number (64342461622200).
Almost surely, 2244501354164341 is an apocalyptic number.
It is an amenable number.
244501354164341 is a deficient number, since it is larger than the sum of its proper divisors (12868492324459).
244501354164341 is a wasteful number, since it uses less digits than its factorization.
244501354164341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12868492324458.
The product of its (nonzero) digits is 2764800, while the sum is 47.
The spelling of 244501354164341 in words is "two hundred forty-four trillion, five hundred one billion, three hundred fifty-four million, one hundred sixty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •