Base | Representation |
---|---|
bin | 10000101101010… |
… | …01010101010110 |
3 | 100202201120102020 |
4 | 20112221111112 |
5 | 241334413243 |
6 | 21523554010 |
7 | 3321201552 |
oct | 1026512526 |
9 | 322646366 |
10 | 140154198 |
11 | 72127a18 |
12 | 3ab2b906 |
13 | 230625a2 |
14 | 14884862 |
15 | c487283 |
hex | 85a9556 |
140154198 has 8 divisors (see below), whose sum is σ = 280308408. Its totient is φ = 46718064.
The previous prime is 140154197. The next prime is 140154227. The reversal of 140154198 is 891451041.
It is a sphenic number, since it is the product of 3 distinct primes.
140154198 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140154191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11679511 + ... + 11679522.
It is an arithmetic number, because the mean of its divisors is an integer number (35038551).
Almost surely, 2140154198 is an apocalyptic number.
140154198 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140154198 is a wasteful number, since it uses less digits than its factorization.
140154198 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23359038.
The product of its (nonzero) digits is 5760, while the sum is 33.
The square root of 140154198 is about 11838.6738277562. The cubic root of 140154198 is about 519.4399764775.
The spelling of 140154198 in words is "one hundred forty million, one hundred fifty-four thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •