Base | Representation |
---|---|
bin | 110111101000111100110010… |
… | …000010100001111010011001 |
3 | 1012002102201111210002120020022 |
4 | 313220330302002201322121 |
5 | 224033233104402313333 |
6 | 2224240354412040225 |
7 | 102354316461531611 |
oct | 6750746202417231 |
9 | 1162381453076208 |
10 | 244706601213593 |
11 | 70a75539996102 |
12 | 23541941763075 |
13 | a67096c5b9b3c |
14 | 445dc11333a41 |
15 | 1d455a8613c98 |
hex | de8f320a1e99 |
244706601213593 has 2 divisors, whose sum is σ = 244706601213594. Its totient is φ = 244706601213592.
The previous prime is 244706601213533. The next prime is 244706601213611. The reversal of 244706601213593 is 395312106607442.
244706601213593 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 165512033061904 + 79194568151689 = 12865148^2 + 8899133^2 .
It is a cyclic number.
It is not a de Polignac number, because 244706601213593 - 210 = 244706601212569 is a prime.
It is not a weakly prime, because it can be changed into another prime (244706601213533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122353300606796 + 122353300606797.
It is an arithmetic number, because the mean of its divisors is an integer number (122353300606797).
Almost surely, 2244706601213593 is an apocalyptic number.
It is an amenable number.
244706601213593 is a deficient number, since it is larger than the sum of its proper divisors (1).
244706601213593 is an equidigital number, since it uses as much as digits as its factorization.
244706601213593 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6531840, while the sum is 53.
The spelling of 244706601213593 in words is "two hundred forty-four trillion, seven hundred six billion, six hundred one million, two hundred thirteen thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •