Base | Representation |
---|---|
bin | 11110010101011111101… |
… | …01100000010010110101 |
3 | 10200122102220210011011010 |
4 | 33022233311200102311 |
5 | 114034144010434331 |
6 | 2114501334502433 |
7 | 135206650605114 |
oct | 17125765402265 |
9 | 3618386704133 |
10 | 1042332124341 |
11 | 372061346522 |
12 | 14a016b04a19 |
13 | 773a3560121 |
14 | 38640645c7b |
15 | 1c1a7d67e46 |
hex | f2afd604b5 |
1042332124341 has 16 divisors (see below), whose sum is σ = 1471554172800. Its totient is φ = 654000549888.
The previous prime is 1042332124333. The next prime is 1042332124349. The reversal of 1042332124341 is 1434212332401.
It is an interprime number because it is at equal distance from previous prime (1042332124333) and next prime (1042332124349).
It is not a de Polignac number, because 1042332124341 - 23 = 1042332124333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1042332124299 and 1042332124308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042332124349) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3332565 + ... + 3631893.
It is an arithmetic number, because the mean of its divisors is an integer number (91972135800).
Almost surely, 21042332124341 is an apocalyptic number.
It is an amenable number.
1042332124341 is a deficient number, since it is larger than the sum of its proper divisors (429222048459).
1042332124341 is a wasteful number, since it uses less digits than its factorization.
1042332124341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367628.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1042332124341 its reverse (1434212332401), we get a palindrome (2476544456742).
The spelling of 1042332124341 in words is "one trillion, forty-two billion, three hundred thirty-two million, one hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •