Base | Representation |
---|---|
bin | 100000010010110100010000… |
… | …000100000100100101001101 |
3 | 200121212222122202011021102012 |
4 | 200102310100010010211031 |
5 | 122104012023002423341 |
6 | 1222023533010511005 |
7 | 41626240155110621 |
oct | 4022642004044515 |
9 | 617788582137365 |
10 | 142030543014221 |
11 | 412898a6891744 |
12 | 13b1a579595465 |
13 | 61335659a2744 |
14 | 271045a377181 |
15 | 1164818b060eb |
hex | 812d1010494d |
142030543014221 has 8 divisors (see below), whose sum is σ = 142112032930560. Its totient is φ = 141949054859328.
The previous prime is 142030543014197. The next prime is 142030543014251. The reversal of 142030543014221 is 122410345030241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142030543014221 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142030543014251) 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, 182655470 + ... + 183431408.
It is an arithmetic number, because the mean of its divisors is an integer number (17764004116320).
Almost surely, 2142030543014221 is an apocalyptic number.
It is an amenable number.
142030543014221 is a deficient number, since it is larger than the sum of its proper divisors (81489916339).
142030543014221 is a wasteful number, since it uses less digits than its factorization.
142030543014221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880723.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 142030543014221 its reverse (122410345030241), we get a palindrome (264440888044462).
The spelling of 142030543014221 in words is "one hundred forty-two trillion, thirty billion, five hundred forty-three million, fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •