Base | Representation |
---|---|
bin | 10000101110001… |
… | …00001101000101 |
3 | 100202221011101122 |
4 | 20113010031011 |
5 | 241401424021 |
6 | 21530203325 |
7 | 3322140464 |
oct | 1027041505 |
9 | 322834348 |
10 | 140264261 |
11 | 721a2685 |
12 | 3ab83545 |
13 | 230a0707 |
14 | 148b29db |
15 | c4a9bab |
hex | 85c4345 |
140264261 has 8 divisors (see below), whose sum is σ = 141671424. Its totient is φ = 138862080.
The previous prime is 140264233. The next prime is 140264269. The reversal of 140264261 is 162462041.
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 140264261 - 222 = 136069957 is a prime.
It is a super-2 number, since 2×1402642612 = 39348125827752242, which contains 22 as substring.
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 140264261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140264269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80546 + ... + 82268.
It is an arithmetic number, because the mean of its divisors is an integer number (17708928).
Almost surely, 2140264261 is an apocalyptic number.
It is an amenable number.
140264261 is a deficient number, since it is larger than the sum of its proper divisors (1407163).
140264261 is a wasteful number, since it uses less digits than its factorization.
140264261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2491.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 140264261 is about 11843.3213669139. The cubic root of 140264261 is about 519.5759128580.
The spelling of 140264261 in words is "one hundred forty million, two hundred sixty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •