Base | Representation |
---|---|
bin | 10000110001011… |
… | …00011010000101 |
3 | 100210201211212122 |
4 | 20120230122011 |
5 | 242004103302 |
6 | 21543255325 |
7 | 3325566032 |
oct | 1030543205 |
9 | 323654778 |
10 | 140691077 |
11 | 7246431a |
12 | 3b14a545 |
13 | 231bca77 |
14 | 14984389 |
15 | c5413a2 |
hex | 862c685 |
140691077 has 4 divisors (see below), whose sum is σ = 140780556. Its totient is φ = 140601600.
The previous prime is 140691073. The next prime is 140691137. The reversal of 140691077 is 770196041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 770196041 = 19739 ⋅39019.
It can be written as a sum of positive squares in 2 ways, for example, as 132112036 + 8579041 = 11494^2 + 2929^2 .
It is a cyclic number.
It is not a de Polignac number, because 140691077 - 22 = 140691073 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140691073) 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 3 ways as a sum of consecutive naturals, for example, 42338 + ... + 45539.
It is an arithmetic number, because the mean of its divisors is an integer number (35195139).
Almost surely, 2140691077 is an apocalyptic number.
It is an amenable number.
140691077 is a deficient number, since it is larger than the sum of its proper divisors (89479).
140691077 is an equidigital number, since it uses as much as digits as its factorization.
140691077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89478.
The product of its (nonzero) digits is 10584, while the sum is 35.
The square root of 140691077 is about 11861.3269493763. The cubic root of 140691077 is about 520.1023923121.
The spelling of 140691077 in words is "one hundred forty million, six hundred ninety-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •