Base | Representation |
---|---|
bin | 1110001110000101111… |
… | …1100000100011110001 |
3 | 212100120210000000002102 |
4 | 3203201133200203301 |
5 | 13000312113131001 |
6 | 304121440430145 |
7 | 23436004542611 |
oct | 3434137404361 |
9 | 770523000072 |
10 | 244301302001 |
11 | 94675797089 |
12 | 3b420018355 |
13 | 1a064558743 |
14 | bb77a34a41 |
15 | 654c89ae6b |
hex | 38e17e08f1 |
244301302001 has 2 divisors, whose sum is σ = 244301302002. Its totient is φ = 244301302000.
The previous prime is 244301301989. The next prime is 244301302009. The reversal of 244301302001 is 100203103442.
244301302001 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., 228311952400 + 15989349601 = 477820^2 + 126449^2 .
It is a cyclic number.
It is not a de Polignac number, because 244301302001 - 214 = 244301285617 is a prime.
It is not a weakly prime, because it can be changed into another prime (244301302009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122150651000 + 122150651001.
It is an arithmetic number, because the mean of its divisors is an integer number (122150651001).
Almost surely, 2244301302001 is an apocalyptic number.
It is an amenable number.
244301302001 is a deficient number, since it is larger than the sum of its proper divisors (1).
244301302001 is an equidigital number, since it uses as much as digits as its factorization.
244301302001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 244301302001 its reverse (100203103442), we get a palindrome (344504405443).
The spelling of 244301302001 in words is "two hundred forty-four billion, three hundred one million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •