Base | Representation |
---|---|
bin | 101000000100000… |
… | …0110110000110011 |
3 | 10110200112121211211 |
4 | 1100020012300303 |
5 | 10223120132011 |
6 | 341221020551 |
7 | 45212244124 |
oct | 12010066063 |
9 | 3420477754 |
10 | 1344302131 |
11 | 62a9070a7 |
12 | 316254757 |
13 | 185679a63 |
14 | ca77404b |
15 | 7d041b21 |
hex | 50206c33 |
1344302131 has 8 divisors (see below), whose sum is σ = 1386238464. Its totient is φ = 1302921480.
The previous prime is 1344302129. The next prime is 1344302147. The reversal of 1344302131 is 1312034431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1344302131 - 21 = 1344302129 is a prime.
It is a super-2 number, since 2×13443021312 = 3614296438822282322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1344302161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134005 + ... + 143686.
It is an arithmetic number, because the mean of its divisors is an integer number (173279808).
Almost surely, 21344302131 is an apocalyptic number.
1344302131 is a deficient number, since it is larger than the sum of its proper divisors (41936333).
1344302131 is a wasteful number, since it uses less digits than its factorization.
1344302131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277841.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1344302131 is about 36664.7259774296. The cubic root of 1344302131 is about 1103.6523584559.
Adding to 1344302131 its reverse (1312034431), we get a palindrome (2656336562).
The spelling of 1344302131 in words is "one billion, three hundred forty-four million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •