Base | Representation |
---|---|
bin | 101000000011111… |
… | …0010111111001011 |
3 | 10110200101111201211 |
4 | 1100013302333023 |
5 | 10223110034011 |
6 | 341215153551 |
7 | 45211456021 |
oct | 12007627713 |
9 | 3420344654 |
10 | 1344221131 |
11 | 62a861260 |
12 | 3162158b7 |
13 | 18564bc26 |
14 | ca752711 |
15 | 7d027b21 |
hex | 501f2fcb |
1344221131 has 16 divisors (see below), whose sum is σ = 1556133120. Its totient is φ = 1149063520.
The previous prime is 1344221129. The next prime is 1344221143. The reversal of 1344221131 is 1311224431.
It is not a de Polignac number, because 1344221131 - 21 = 1344221129 is a prime.
It is a super-2 number, since 2×13442211312 = 3613860898053838322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1344224131) 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 15 ways as a sum of consecutive naturals, for example, 30100 + ... + 59953.
It is an arithmetic number, because the mean of its divisors is an integer number (97258320).
Almost surely, 21344221131 is an apocalyptic number.
1344221131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1344221131 is a deficient number, since it is larger than the sum of its proper divisors (211911989).
1344221131 is a wasteful number, since it uses less digits than its factorization.
1344221131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90146.
The product of its digits is 576, while the sum is 22.
The square root of 1344221131 is about 36663.6213568709. The cubic root of 1344221131 is about 1103.6301914062.
Adding to 1344221131 its reverse (1311224431), we get a palindrome (2655445562).
The spelling of 1344221131 in words is "one billion, three hundred forty-four million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •