Base | Representation |
---|---|
bin | 1000010001011101000… |
… | …0001100100001100101 |
3 | 111120211212110102002001 |
4 | 2010113100030201211 |
5 | 4312032223323331 |
6 | 145142455245301 |
7 | 13160652266401 |
oct | 2042720144145 |
9 | 446755412061 |
10 | 142124042341 |
11 | 55302353636 |
12 | 23665079831 |
13 | 1052c94a198 |
14 | 6c43776101 |
15 | 3a6c437561 |
hex | 211740c865 |
142124042341 has 4 divisors (see below), whose sum is σ = 145429252672. Its totient is φ = 138818832012.
The previous prime is 142124042339. The next prime is 142124042351. The reversal of 142124042341 is 143240421241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 142124042341 - 21 = 142124042339 is a prime.
It is a super-2 number, since 2×1421240423412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142124042351) 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, 1652605101 + ... + 1652605186.
It is an arithmetic number, because the mean of its divisors is an integer number (36357313168).
Almost surely, 2142124042341 is an apocalyptic number.
It is an amenable number.
142124042341 is a deficient number, since it is larger than the sum of its proper divisors (3305210331).
142124042341 is an equidigital number, since it uses as much as digits as its factorization.
142124042341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3305210330.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 142124042341 its reverse (143240421241), we get a palindrome (285364463582).
The spelling of 142124042341 in words is "one hundred forty-two billion, one hundred twenty-four million, forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •