Base | Representation |
---|---|
bin | 1000001010101010100… |
… | …1011010010010010001 |
3 | 111102010212211210202011 |
4 | 2002222221122102101 |
5 | 4244314243421021 |
6 | 144242005222521 |
7 | 13064545530331 |
oct | 2025251322221 |
9 | 442125753664 |
10 | 140301935761 |
11 | 5455786aa29 |
12 | 23236a01a41 |
13 | 102cc2b9c00 |
14 | 6b0d7870c1 |
15 | 39b24b3de1 |
hex | 20aaa5a491 |
140301935761 has 9 divisors (see below), whose sum is σ = 151929854289. Its totient is φ = 129504984336.
The previous prime is 140301935701. The next prime is 140301935779. The reversal of 140301935761 is 167539103041.
The square root of 140301935761 is 374569.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 67272278161 + 73029657600 = 259369^2 + 270240^2 .
It is not a de Polignac number, because 140301935761 - 27 = 140301935633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140301935701) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4854991 + ... + 4883803.
It is an arithmetic number, because the mean of its divisors is an integer number (16881094921).
Almost surely, 2140301935761 is an apocalyptic number.
140301935761 is the 374569-th square number.
140301935761 is the 187285-th centered octagonal number.
It is an amenable number.
140301935761 is a deficient number, since it is larger than the sum of its proper divisors (11627918528).
140301935761 is an frugal number, since it uses more digits than its factorization.
140301935761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57652 (or 28826 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 40.
The spelling of 140301935761 in words is "one hundred forty billion, three hundred one million, nine hundred thirty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •