Base | Representation |
---|---|
bin | 11111111001101001111110… |
… | …100000000001000001000001 |
3 | 200101202200202102212110022201 |
4 | 133321221332200001001001 |
5 | 121342200010121404441 |
6 | 1214221344053033201 |
7 | 41360310362101402 |
oct | 3771517640010101 |
9 | 611680672773281 |
10 | 140301524013121 |
11 | 407825a671a119 |
12 | 1389b460625801 |
13 | 60394b91bb503 |
14 | 26908b69c39a9 |
15 | 1134870889c31 |
hex | 7f9a7e801041 |
140301524013121 has 32 divisors (see below), whose sum is σ = 143097321185280. Its totient is φ = 137536952728896.
The previous prime is 140301524013073. The next prime is 140301524013149. The reversal of 140301524013121 is 121310425103041.
It is a cyclic number.
It is not a de Polignac number, because 140301524013121 - 215 = 140301523980353 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 140301524013121.
It is not an unprimeable number, because it can be changed into a prime (140301524053121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6915823840 + ... + 6915844126.
It is an arithmetic number, because the mean of its divisors is an integer number (4471791287040).
Almost surely, 2140301524013121 is an apocalyptic number.
It is an amenable number.
140301524013121 is a deficient number, since it is larger than the sum of its proper divisors (2795797172159).
140301524013121 is a wasteful number, since it uses less digits than its factorization.
140301524013121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21813.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 140301524013121 its reverse (121310425103041), we get a palindrome (261611949116162).
The spelling of 140301524013121 in words is "one hundred forty trillion, three hundred one billion, five hundred twenty-four million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •