Base | Representation |
---|---|
bin | 10000101101100… |
… | …10101000010001 |
3 | 100202210111122102 |
4 | 20112302220101 |
5 | 241342123043 |
6 | 21524450145 |
7 | 3321420554 |
oct | 1026625021 |
9 | 322714572 |
10 | 140192273 |
11 | 72153591 |
12 | 3ab49955 |
13 | 23076a10 |
14 | 1489469b |
15 | c4936b8 |
hex | 85b2a11 |
140192273 has 4 divisors (see below), whose sum is σ = 150976308. Its totient is φ = 129408240.
The previous prime is 140192267. The next prime is 140192321. The reversal of 140192273 is 372291041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 59336209 + 80856064 = 7703^2 + 8992^2 .
It is not a de Polignac number, because 140192273 - 212 = 140188177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140192573) 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, 5391998 + ... + 5392023.
It is an arithmetic number, because the mean of its divisors is an integer number (37744077).
Almost surely, 2140192273 is an apocalyptic number.
140192273 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
140192273 is a deficient number, since it is larger than the sum of its proper divisors (10784035).
140192273 is a wasteful number, since it uses less digits than its factorization.
140192273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10784034.
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 140192273 is about 11840.2817956331. The cubic root of 140192273 is about 519.4870101178.
The spelling of 140192273 in words is "one hundred forty million, one hundred ninety-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •