Base | Representation |
---|---|
bin | 111100010001100011001… |
… | …110100011000011101101 |
3 | 112122222021000122022220002 |
4 | 330101203032203003231 |
5 | 1020330320341400331 |
6 | 12450451542234045 |
7 | 605151643362416 |
oct | 74214316430355 |
9 | 15588230568802 |
10 | 4142013231341 |
11 | 135768853a267 |
12 | 56a8bba25925 |
13 | 2407897b837b |
14 | 1046900ac80d |
15 | 72b238049cb |
hex | 3c4633a30ed |
4142013231341 has 2 divisors, whose sum is σ = 4142013231342. Its totient is φ = 4142013231340.
The previous prime is 4142013231299. The next prime is 4142013231361. The reversal of 4142013231341 is 1431323102414.
4142013231341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4130869262116 + 11143969225 = 2032454^2 + 105565^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4142013231341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4142013231361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2071006615670 + 2071006615671.
It is an arithmetic number, because the mean of its divisors is an integer number (2071006615671).
Almost surely, 24142013231341 is an apocalyptic number.
It is an amenable number.
4142013231341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4142013231341 is an equidigital number, since it uses as much as digits as its factorization.
4142013231341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 4142013231341 its reverse (1431323102414), we get a palindrome (5573336333755).
The spelling of 4142013231341 in words is "four trillion, one hundred forty-two billion, thirteen million, two hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •