Base | Representation |
---|---|
bin | 11111111000110000101100… |
… | …001111011110001011000001 |
3 | 200101112210222201200110202102 |
4 | 133320300230033132023001 |
5 | 121340143022141332431 |
6 | 1214133212340400145 |
7 | 41353002202036655 |
oct | 3770605417361301 |
9 | 611483881613672 |
10 | 140240014402241 |
11 | 40759502098066 |
12 | 1388b5550a6055 |
13 | 6033765a85660 |
14 | 268b91d848a65 |
15 | 1132e7083edcb |
hex | 7f8c2c3de2c1 |
140240014402241 has 16 divisors (see below), whose sum is σ = 152588195279184. Its totient is φ = 128114821545984.
The previous prime is 140240014402223. The next prime is 140240014402247. The reversal of 140240014402241 is 142204410042041.
It can be written as a sum of positive squares in 8 ways, for example, as 5380080250000 + 134859934152241 = 2319500^2 + 11612921^2 .
It is not a de Polignac number, because 140240014402241 - 210 = 140240014401217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140240014402247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54680561 + ... + 57187793.
It is an arithmetic number, because the mean of its divisors is an integer number (9536762204949).
Almost surely, 2140240014402241 is an apocalyptic number.
It is an amenable number.
140240014402241 is a deficient number, since it is larger than the sum of its proper divisors (12348180876943).
140240014402241 is a wasteful number, since it uses less digits than its factorization.
140240014402241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2551700.
The product of its (nonzero) digits is 8192, while the sum is 29.
Adding to 140240014402241 its reverse (142204410042041), we get a palindrome (282444424444282).
The spelling of 140240014402241 in words is "one hundred forty trillion, two hundred forty billion, fourteen million, four hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •