Base | Representation |
---|---|
bin | 1000010001011001111… |
… | …1100110010111000111 |
3 | 111120210222111012010201 |
4 | 2010112133212113013 |
5 | 4312020443144421 |
6 | 145141322231331 |
7 | 13160436100651 |
oct | 2042637462707 |
9 | 446728435121 |
10 | 142111303111 |
11 | 552a6142448 |
12 | 23660955547 |
13 | 1052a10988b |
14 | 6c41bbb6d1 |
15 | 3a6b26cb91 |
hex | 21167e65c7 |
142111303111 has 4 divisors (see below), whose sum is σ = 149590845400. Its totient is φ = 134631760824.
The previous prime is 142111303099. The next prime is 142111303121. The reversal of 142111303111 is 111303111241.
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 142111303111 - 211 = 142111301063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 7479542269 = 142111303111 / (1 + 4 + 2 + 1 + 1 + 1 + 3 + 0 + 3 + 1 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142111303121) 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, 3739771116 + ... + 3739771153.
It is an arithmetic number, because the mean of its divisors is an integer number (37397711350).
Almost surely, 2142111303111 is an apocalyptic number.
142111303111 is a deficient number, since it is larger than the sum of its proper divisors (7479542289).
142111303111 is an equidigital number, since it uses as much as digits as its factorization.
142111303111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7479542288.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 142111303111 its reverse (111303111241), we get a palindrome (253414414352).
The spelling of 142111303111 in words is "one hundred forty-two billion, one hundred eleven million, three hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •