Base | Representation |
---|---|
bin | 10000111011100… |
… | …01010111010101 |
3 | 100220020110200211 |
4 | 20131301113111 |
5 | 242324201401 |
6 | 22032005421 |
7 | 3343111414 |
oct | 1035612725 |
9 | 326213624 |
10 | 142022101 |
11 | 73193341 |
12 | 3b690871 |
13 | 23567860 |
14 | 14c0d47b |
15 | c705951 |
hex | 87715d5 |
142022101 has 8 divisors (see below), whose sum is σ = 153833400. Its totient is φ = 130337472.
The previous prime is 142022099. The next prime is 142022113. The reversal of 142022101 is 101220241.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 13176900 + 128845201 = 3630^2 + 11351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142022101 - 21 = 142022099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142022141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29326 + ... + 33823.
It is an arithmetic number, because the mean of its divisors is an integer number (19229175).
Almost surely, 2142022101 is an apocalyptic number.
It is an amenable number.
142022101 is a deficient number, since it is larger than the sum of its proper divisors (11811299).
142022101 is a wasteful number, since it uses less digits than its factorization.
142022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63335.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 142022101 is about 11917.3025890929. The cubic root of 142022101 is about 521.7374097032.
Adding to 142022101 its reverse (101220241), we get a palindrome (243242342).
The spelling of 142022101 in words is "one hundred forty-two million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •