Base | Representation |
---|---|
bin | 11110010101000111101… |
… | …11000010110100111101 |
3 | 10200121220220201012121112 |
4 | 33022203313002310331 |
5 | 114033241041420331 |
6 | 2114425400211405 |
7 | 135201661024556 |
oct | 17124367026475 |
9 | 3617826635545 |
10 | 1042131201341 |
11 | 371a6899305a |
12 | 149b7b769b65 |
13 | 77370a41989 |
14 | 38621aa332d |
15 | 1c1953ca32b |
hex | f2a3dc2d3d |
1042131201341 has 16 divisors (see below), whose sum is σ = 1105795007856. Its totient is φ = 978731237376.
The previous prime is 1042131201317. The next prime is 1042131201361. The reversal of 1042131201341 is 1431021312401.
It can be written as a sum of positive squares in 8 ways, for example, as 857514892441 + 184616308900 = 926021^2 + 429670^2 .
It is not a de Polignac number, because 1042131201341 - 218 = 1042130939197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042131201361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25649855 + ... + 25690451.
It is an arithmetic number, because the mean of its divisors is an integer number (69112187991).
Almost surely, 21042131201341 is an apocalyptic number.
It is an amenable number.
1042131201341 is a deficient number, since it is larger than the sum of its proper divisors (63663806515).
1042131201341 is a wasteful number, since it uses less digits than its factorization.
1042131201341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43808.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1042131201341 its reverse (1431021312401), we get a palindrome (2473152513742).
The spelling of 1042131201341 in words is "one trillion, forty-two billion, one hundred thirty-one million, two hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •