Base | Representation |
---|---|
bin | 1000010011000010111… |
… | …1011000111100000011 |
3 | 111121221200002010120122 |
4 | 2010300233120330003 |
5 | 4313421210300201 |
6 | 145253132330455 |
7 | 13204364014166 |
oct | 2046057307403 |
9 | 447850063518 |
10 | 142551650051 |
11 | 55501765638 |
12 | 23764313a2b |
13 | 1059a4068b5 |
14 | 6c84485add |
15 | 3a94c50e1b |
hex | 2130bd8f03 |
142551650051 has 4 divisors (see below), whose sum is σ = 143813169192. Its totient is φ = 141290130912.
The previous prime is 142551650023. The next prime is 142551650069. The reversal of 142551650051 is 150056155241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150056155241 = 185849 ⋅807409.
It is a cyclic number.
It is not a de Polignac number, because 142551650051 - 26 = 142551649987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142551649993 and 142551650020.
It is not an unprimeable number, because it can be changed into a prime (142551650011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 630759401 + ... + 630759626.
It is an arithmetic number, because the mean of its divisors is an integer number (35953292298).
Almost surely, 2142551650051 is an apocalyptic number.
142551650051 is a deficient number, since it is larger than the sum of its proper divisors (1261519141).
142551650051 is a wasteful number, since it uses less digits than its factorization.
142551650051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1261519140.
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 142551650051 in words is "one hundred forty-two billion, five hundred fifty-one million, six hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •