Base | Representation |
---|---|
bin | 10000111110000… |
… | …01011100010101 |
3 | 100220212010121222 |
4 | 20133001130111 |
5 | 242420200401 |
6 | 22043020125 |
7 | 3345645605 |
oct | 1037013425 |
9 | 326763558 |
10 | 142350101 |
11 | 73397813 |
12 | 3b80a645 |
13 | 23650c3a |
14 | 14c96c05 |
15 | c76cc1b |
hex | 87c1715 |
142350101 has 4 divisors (see below), whose sum is σ = 144355104. Its totient is φ = 140345100.
The previous prime is 142350097. The next prime is 142350113. The reversal of 142350101 is 101053241.
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 142350101 - 22 = 142350097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142350101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142350121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1002395 + ... + 1002536.
It is an arithmetic number, because the mean of its divisors is an integer number (36088776).
Almost surely, 2142350101 is an apocalyptic number.
It is an amenable number.
142350101 is a deficient number, since it is larger than the sum of its proper divisors (2005003).
142350101 is an equidigital number, since it uses as much as digits as its factorization.
142350101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005002.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 142350101 is about 11931.0561560995. The cubic root of 142350101 is about 522.1387516926.
The spelling of 142350101 in words is "one hundred forty-two million, three hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •