Base | Representation |
---|---|
bin | 10001000000111… |
… | …01001111011111 |
3 | 100221120020102021 |
4 | 20200131033133 |
5 | 243014213421 |
6 | 22055041011 |
7 | 3352103053 |
oct | 1040351737 |
9 | 327506367 |
10 | 142726111 |
11 | 73624270 |
12 | 3b970167 |
13 | 23753128 |
14 | 14d53c63 |
15 | c7e4341 |
hex | 881d3df |
142726111 has 4 divisors (see below), whose sum is σ = 155701224. Its totient is φ = 129751000.
The previous prime is 142726093. The next prime is 142726163. The reversal of 142726111 is 111627241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111627241 = 11 ⋅10147931.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142726111 is a prime.
It is a super-2 number, since 2×1427261112 = 40741485522368642, which 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 (142723111) 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, 6487540 + ... + 6487561.
It is an arithmetic number, because the mean of its divisors is an integer number (38925306).
Almost surely, 2142726111 is an apocalyptic number.
142726111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
142726111 is a deficient number, since it is larger than the sum of its proper divisors (12975113).
142726111 is a wasteful number, since it uses less digits than its factorization.
142726111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12975112.
The product of its digits is 672, while the sum is 25.
The square root of 142726111 is about 11946.8033799841. The cubic root of 142726111 is about 522.5980811426.
The spelling of 142726111 in words is "one hundred forty-two million, seven hundred twenty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •