Base | Representation |
---|---|
bin | 1110001101100001111… |
… | …0101111010111000101 |
3 | 212100012020111102112112 |
4 | 3203120132233113011 |
5 | 13000004411334131 |
6 | 304054440030405 |
7 | 23432160440606 |
oct | 3433036572705 |
9 | 770166442475 |
10 | 244150105541 |
11 | 945a8407a31 |
12 | 3b399462405 |
13 | 1a03c12b094 |
14 | bb61917dad |
15 | 653e48202b |
hex | 38d87af5c5 |
244150105541 has 2 divisors, whose sum is σ = 244150105542. Its totient is φ = 244150105540.
The previous prime is 244150105523. The next prime is 244150105561. The reversal of 244150105541 is 145501051442.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 240070600900 + 4079504641 = 489970^2 + 63871^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-244150105541 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 244150105498 and 244150105507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244150105561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122075052770 + 122075052771.
It is an arithmetic number, because the mean of its divisors is an integer number (122075052771).
Almost surely, 2244150105541 is an apocalyptic number.
It is an amenable number.
244150105541 is a deficient number, since it is larger than the sum of its proper divisors (1).
244150105541 is an equidigital number, since it uses as much as digits as its factorization.
244150105541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16000, while the sum is 32.
Adding to 244150105541 its reverse (145501051442), we get a palindrome (389651156983).
The spelling of 244150105541 in words is "two hundred forty-four billion, one hundred fifty million, one hundred five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •