Base | Representation |
---|---|
bin | 10000101110110… |
… | …11111110001101 |
3 | 100210010002221021 |
4 | 20113123332031 |
5 | 241413032423 |
6 | 21532234141 |
7 | 3323024350 |
oct | 1027337615 |
9 | 323102837 |
10 | 140361613 |
11 | 72259837 |
12 | 3b00b951 |
13 | 23105b12 |
14 | 148da297 |
15 | c4c895d |
hex | 85dbf8d |
140361613 has 4 divisors (see below), whose sum is σ = 160413280. Its totient is φ = 120309948.
The previous prime is 140361547. The next prime is 140361623. The reversal of 140361613 is 316163041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 316163041 = 199 ⋅1588759.
It is a cyclic number.
It is not a de Polignac number, because 140361613 - 29 = 140361101 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 (140361623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10025823 + ... + 10025836.
It is an arithmetic number, because the mean of its divisors is an integer number (40103320).
Almost surely, 2140361613 is an apocalyptic number.
It is an amenable number.
140361613 is a deficient number, since it is larger than the sum of its proper divisors (20051667).
140361613 is an equidigital number, since it uses as much as digits as its factorization.
140361613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20051666.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 140361613 is about 11847.4306497232. The cubic root of 140361613 is about 519.6960909089.
The spelling of 140361613 in words is "one hundred forty million, three hundred sixty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.089 sec. • engine limits •