Base | Representation |
---|---|
bin | 110111101000111100101110… |
… | …001111010101011001000001 |
3 | 1012002102201100100010121112202 |
4 | 313220330232033111121001 |
5 | 224033232442042230223 |
6 | 2224240344213402545 |
7 | 102354315055616114 |
oct | 6750745617253101 |
9 | 1162381310117482 |
10 | 244706537461313 |
11 | 70a75506a02074 |
12 | 23541924339455 |
13 | a67095c327cb5 |
14 | 445dc06a9a57b |
15 | 1d455a2c1e428 |
hex | de8f2e3d5641 |
244706537461313 has 8 divisors (see below), whose sum is σ = 259531951350336. Its totient is φ = 230229956840400.
The previous prime is 244706537461303. The next prime is 244706537461333. The reversal of 244706537461313 is 313164735607442.
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 244706537461313 - 240 = 243607025833537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (244706537461303) 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, 87208315583 + ... + 87208318388.
It is an arithmetic number, because the mean of its divisors is an integer number (32441493918792).
Almost surely, 2244706537461313 is an apocalyptic number.
244706537461313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
244706537461313 is a deficient number, since it is larger than the sum of its proper divisors (14825413889023).
244706537461313 is a wasteful number, since it uses less digits than its factorization.
244706537461313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174416634055.
The product of its (nonzero) digits is 30481920, while the sum is 56.
The spelling of 244706537461313 in words is "two hundred forty-four trillion, seven hundred six billion, five hundred thirty-seven million, four hundred sixty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •