Base | Representation |
---|---|
bin | 1000010001110001100… |
… | …0001110001110100111 |
3 | 111121001212021011110122 |
4 | 2010130120032032213 |
5 | 4312221232020201 |
6 | 145155210312155 |
7 | 13163045221616 |
oct | 2043430161647 |
9 | 447055234418 |
10 | 142210032551 |
11 | 55346946324 |
12 | 23689a2865b |
13 | 105446c6c72 |
14 | 6c50d5b87d |
15 | 3a74c70e1b |
hex | 211c60e3a7 |
142210032551 has 8 divisors (see below), whose sum is σ = 142332432000. Its totient is φ = 142087690080.
The previous prime is 142210032511. The next prime is 142210032563. The reversal of 142210032551 is 155230012241.
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 142210032551 - 226 = 142142923687 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 142210032551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142210032511) 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 7 ways as a sum of consecutive naturals, for example, 6027125 + ... + 6050673.
It is an arithmetic number, because the mean of its divisors is an integer number (17791554000).
Almost surely, 2142210032551 is an apocalyptic number.
142210032551 is a deficient number, since it is larger than the sum of its proper divisors (122399449).
142210032551 is a wasteful number, since it uses less digits than its factorization.
142210032551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28489.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 142210032551 its reverse (155230012241), we get a palindrome (297440044792).
The spelling of 142210032551 in words is "one hundred forty-two billion, two hundred ten million, thirty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •