Base | Representation |
---|---|
bin | 101011000010011… |
… | …1110010100101111 |
3 | 10201122102010201210 |
4 | 1112010332110233 |
5 | 10424200110211 |
6 | 355145005503 |
7 | 50534011422 |
oct | 12604762457 |
9 | 3648363653 |
10 | 1444144431 |
11 | 6812000a4 |
12 | 343783893 |
13 | 1a0266842 |
14 | d9b239b9 |
15 | 86bb49a6 |
hex | 5613e52f |
1444144431 has 4 divisors (see below), whose sum is σ = 1925525912. Its totient is φ = 962762952.
The previous prime is 1444144409. The next prime is 1444144433. The reversal of 1444144431 is 1344414441.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1444144431 - 218 = 1443882287 is a prime.
It is a super-2 number, since 2×14441444312 = 4171106275176627522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1444144433) 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, 240690736 + ... + 240690741.
It is an arithmetic number, because the mean of its divisors is an integer number (481381478).
Almost surely, 21444144431 is an apocalyptic number.
1444144431 is a deficient number, since it is larger than the sum of its proper divisors (481381481).
1444144431 is an equidigital number, since it uses as much as digits as its factorization.
1444144431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481381480.
The product of its digits is 12288, while the sum is 30.
The square root of 1444144431 is about 38001.9003603767. The cubic root of 1444144431 is about 1130.3255466863.
Adding to 1444144431 its reverse (1344414441), we get a palindrome (2788558872).
The spelling of 1444144431 in words is "one billion, four hundred forty-four million, one hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •