Base | Representation |
---|---|
bin | 11111111000101011010100… |
… | …000101011010001100101101 |
3 | 200101112021002022212212202211 |
4 | 133320223110011122030231 |
5 | 121340044211020332341 |
6 | 1214130415355450421 |
7 | 41352406130614450 |
oct | 3770532405321455 |
9 | 611467068785684 |
10 | 140234240402221 |
11 | 40757009898419 |
12 | 1388a403456a11 |
13 | 60330557782b4 |
14 | 268b532a69497 |
15 | 1132c3399a181 |
hex | 7f8ad415a32d |
140234240402221 has 8 divisors (see below), whose sum is σ = 160297148097344. Its totient is φ = 120178693902240.
The previous prime is 140234240402213. The next prime is 140234240402251. The reversal of 140234240402221 is 122204042432041.
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 140234240402221 - 23 = 140234240402213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140234240402251) 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, 1840257960 + ... + 1840334161.
It is an arithmetic number, because the mean of its divisors is an integer number (20037143512168).
Almost surely, 2140234240402221 is an apocalyptic number.
It is an amenable number.
140234240402221 is a deficient number, since it is larger than the sum of its proper divisors (20062907695123).
140234240402221 is an equidigital number, since it uses as much as digits as its factorization.
140234240402221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3680597571.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 140234240402221 its reverse (122204042432041), we get a palindrome (262438282834262).
The spelling of 140234240402221 in words is "one hundred forty trillion, two hundred thirty-four billion, two hundred forty million, four hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •