Base | Representation |
---|---|
bin | 10010111110110000110… |
… | …110000001011110100011 |
3 | 11121200201211200001211012 |
4 | 102332300312001132203 |
5 | 132332243030330111 |
6 | 2435112332411135 |
7 | 163143545300453 |
oct | 22766066013643 |
9 | 4550654601735 |
10 | 1304342042531 |
11 | 463194095aa0 |
12 | 190959616aab |
13 | 95cca847088 |
14 | 471b80d7d63 |
15 | 23de021148b |
hex | 12fb0d817a3 |
1304342042531 has 4 divisors (see below), whose sum is σ = 1422918591864. Its totient is φ = 1185765493200.
The previous prime is 1304342042527. The next prime is 1304342042579. The reversal of 1304342042531 is 1352402434031.
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 1304342042531 - 22 = 1304342042527 is a prime.
It is a super-2 number, since 2×13043420425312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1304342042231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59288274650 + ... + 59288274671.
It is an arithmetic number, because the mean of its divisors is an integer number (355729647966).
Almost surely, 21304342042531 is an apocalyptic number.
1304342042531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1304342042531 is a deficient number, since it is larger than the sum of its proper divisors (118576549333).
1304342042531 is a wasteful number, since it uses less digits than its factorization.
1304342042531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118576549332.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 1304342042531 its reverse (1352402434031), we get a palindrome (2656744476562).
The spelling of 1304342042531 in words is "one trillion, three hundred four billion, three hundred forty-two million, forty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •