Base | Representation |
---|---|
bin | 101010111100101… |
… | …0111000100010101 |
3 | 10201102200110122001 |
4 | 1111321113010111 |
5 | 10422410200203 |
6 | 354555435301 |
7 | 50466101611 |
oct | 12571270425 |
9 | 3642613561 |
10 | 1441100053 |
11 | 67a510888 |
12 | 342755b31 |
13 | 19c73bc33 |
14 | d9570341 |
15 | 867b291d |
hex | 55e57115 |
1441100053 has 2 divisors, whose sum is σ = 1441100054. Its totient is φ = 1441100052.
The previous prime is 1441100039. The next prime is 1441100057. The reversal of 1441100053 is 3500011441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1122049009 + 319051044 = 33497^2 + 17862^2 .
It is an emirp because it is prime and its reverse (3500011441) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1441100053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1441100053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1441100057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 720550026 + 720550027.
It is an arithmetic number, because the mean of its divisors is an integer number (720550027).
Almost surely, 21441100053 is an apocalyptic number.
It is an amenable number.
1441100053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1441100053 is an equidigital number, since it uses as much as digits as its factorization.
1441100053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1441100053 is about 37961.8236258481. The cubic root of 1441100053 is about 1129.5307141061.
Adding to 1441100053 its reverse (3500011441), we get a palindrome (4941111494).
The spelling of 1441100053 in words is "one billion, four hundred forty-one million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •