Base | Representation |
---|---|
bin | 101011000010111… |
… | …1110011101011011 |
3 | 10201122220111002102 |
4 | 1112011332131123 |
5 | 10424232012011 |
6 | 355154354015 |
7 | 50536154336 |
oct | 12605763533 |
9 | 3648814072 |
10 | 1444407131 |
11 | 68136a502 |
12 | 34388b90b |
13 | 1a032929b |
14 | d9b9161d |
15 | 86c1773b |
hex | 5617e75b |
1444407131 has 4 divisors (see below), whose sum is σ = 1451969664. Its totient is φ = 1436844600.
The previous prime is 1444407121. The next prime is 1444407137. The reversal of 1444407131 is 1317044441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1444407131 - 210 = 1444406107 is a prime.
It is a super-2 number, since 2×14444071312 = 4172623920167302322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1444407094 and 1444407103.
It is not an unprimeable number, because it can be changed into a prime (1444407137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3780980 + ... + 3781361.
It is an arithmetic number, because the mean of its divisors is an integer number (362992416).
Almost surely, 21444407131 is an apocalyptic number.
1444407131 is a deficient number, since it is larger than the sum of its proper divisors (7562533).
1444407131 is an equidigital number, since it uses as much as digits as its factorization.
1444407131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7562532.
The product of its (nonzero) digits is 5376, while the sum is 29.
The square root of 1444407131 is about 38005.3566092992. The cubic root of 1444407131 is about 1130.3940805789.
The spelling of 1444407131 in words is "one billion, four hundred forty-four million, four hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •