Base | Representation |
---|---|
bin | 1110001101100010101… |
… | …0010010010000000101 |
3 | 212100012110012012002222 |
4 | 3203120222102100011 |
5 | 13000011200211122 |
6 | 304055024542125 |
7 | 23432225244323 |
oct | 3433052222005 |
9 | 770173165088 |
10 | 244153132037 |
11 | 945aa094871 |
12 | 3b39a481945 |
13 | 1a03c94a7c9 |
14 | bb620a4d13 |
15 | 653e87db42 |
hex | 38d8a92405 |
244153132037 has 2 divisors, whose sum is σ = 244153132038. Its totient is φ = 244153132036.
The previous prime is 244153132033. The next prime is 244153132049. The reversal of 244153132037 is 730231351442.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 236182392196 + 7970739841 = 485986^2 + 89279^2 .
It is a cyclic number.
It is not a de Polignac number, because 244153132037 - 22 = 244153132033 is a prime.
It is a super-2 number, since 2×2441531320372 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 244153131988 and 244153132006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244153132033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122076566018 + 122076566019.
It is an arithmetic number, because the mean of its divisors is an integer number (122076566019).
Almost surely, 2244153132037 is an apocalyptic number.
It is an amenable number.
244153132037 is a deficient number, since it is larger than the sum of its proper divisors (1).
244153132037 is an equidigital number, since it uses as much as digits as its factorization.
244153132037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 35.
Adding to 244153132037 its reverse (730231351442), we get a palindrome (974384483479).
The spelling of 244153132037 in words is "two hundred forty-four billion, one hundred fifty-three million, one hundred thirty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •