Base | Representation |
---|---|
bin | 1110001101111000010… |
… | …1011001001000101011 |
3 | 212100102210102001220012 |
4 | 3203132011121020223 |
5 | 13000202443433303 |
6 | 304112035122135 |
7 | 23434411541522 |
oct | 3433605311053 |
9 | 770383361805 |
10 | 244244124203 |
11 | 94646493602 |
12 | 3b404a4334b |
13 | 1a055759221 |
14 | bb701cd4b9 |
15 | 65478545d8 |
hex | 38de15922b |
244244124203 has 2 divisors, whose sum is σ = 244244124204. Its totient is φ = 244244124202.
The previous prime is 244244124193. The next prime is 244244124211. The reversal of 244244124203 is 302421442442.
244244124203 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 is a cyclic number.
It is not a de Polignac number, because 244244124203 - 226 = 244177015339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 244244124203.
It is not a weakly prime, because it can be changed into another prime (244244124403) 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, 122122062101 + 122122062102.
It is an arithmetic number, because the mean of its divisors is an integer number (122122062102).
Almost surely, 2244244124203 is an apocalyptic number.
244244124203 is a deficient number, since it is larger than the sum of its proper divisors (1).
244244124203 is an equidigital number, since it uses as much as digits as its factorization.
244244124203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49152, while the sum is 32.
Adding to 244244124203 its reverse (302421442442), we get a palindrome (546665566645).
The spelling of 244244124203 in words is "two hundred forty-four billion, two hundred forty-four million, one hundred twenty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •