Base | Representation |
---|---|
bin | 100000000000110110000111… |
… | …011100001110001001001101 |
3 | 200110111221001010001220200011 |
4 | 200000312013130032021031 |
5 | 121423243334341033201 |
6 | 1215240334210233221 |
7 | 41441101050250063 |
oct | 4000660734161115 |
9 | 613457033056604 |
10 | 140795595252301 |
11 | 40953092a93890 |
12 | 1395b167b85811 |
13 | 6073c76c54092 |
14 | 26aa786660033 |
15 | 114263ac58151 |
hex | 800d8770e24d |
140795595252301 has 16 divisors (see below), whose sum is σ = 154259582450688. Its totient is φ = 127442376230400.
The previous prime is 140795595252281. The next prime is 140795595252383. The reversal of 140795595252301 is 103252595597041.
It is not a de Polignac number, because 140795595252301 - 221 = 140795593155149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140795595252901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76677205 + ... + 78491941.
It is an arithmetic number, because the mean of its divisors is an integer number (9641223903168).
Almost surely, 2140795595252301 is an apocalyptic number.
140795595252301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140795595252301 is a deficient number, since it is larger than the sum of its proper divisors (13463987198387).
140795595252301 is a wasteful number, since it uses less digits than its factorization.
140795595252301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1845252.
The product of its (nonzero) digits is 17010000, while the sum is 58.
The spelling of 140795595252301 in words is "one hundred forty trillion, seven hundred ninety-five billion, five hundred ninety-five million, two hundred fifty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •