Base | Representation |
---|---|
bin | 101011000011000… |
… | …0111011111000111 |
3 | 10201122222100210202 |
4 | 1112012013133013 |
5 | 10424234202403 |
6 | 355155241115 |
7 | 50536400204 |
oct | 12606073707 |
9 | 3648870722 |
10 | 1444444103 |
11 | 681395263 |
12 | 3438a919b |
13 | 1a034006b |
14 | d9ba0cab |
15 | 86c23688 |
hex | 561877c7 |
1444444103 has 4 divisors (see below), whose sum is σ = 1461847128. Its totient is φ = 1427041080.
The previous prime is 1444444081. The next prime is 1444444159. The reversal of 1444444103 is 3014444441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3014444441 = 127 ⋅23735783.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1444444103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1444444303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8701388 + ... + 8701553.
It is an arithmetic number, because the mean of its divisors is an integer number (365461782).
Almost surely, 21444444103 is an apocalyptic number.
1444444103 is a deficient number, since it is larger than the sum of its proper divisors (17403025).
1444444103 is an equidigital number, since it uses as much as digits as its factorization.
1444444103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17403024.
The product of its (nonzero) digits is 12288, while the sum is 29.
The square root of 1444444103 is about 38005.8430113055. The cubic root of 1444444103 is about 1130.4037252680.
Adding to 1444444103 its reverse (3014444441), we get a palindrome (4458888544).
The spelling of 1444444103 in words is "one billion, four hundred forty-four million, four hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •