Base | Representation |
---|---|
bin | 10000101111101… |
… | …00100000111110 |
3 | 100210022012211120 |
4 | 20113310200332 |
5 | 241424242032 |
6 | 21534331410 |
7 | 3323623422 |
oct | 1027644076 |
9 | 323265746 |
10 | 140462142 |
11 | 72318317 |
12 | 3b059b66 |
13 | 2313c7c2 |
14 | 14924b82 |
15 | c4e862c |
hex | 85f483e |
140462142 has 8 divisors (see below), whose sum is σ = 280924296. Its totient is φ = 46820712.
The previous prime is 140462093. The next prime is 140462159. The reversal of 140462142 is 241264041.
It is a happy number.
140462142 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
140462142 is an admirable number.
It is a super-2 number, since 2×1404621422 = 39459226670456328, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11705173 + ... + 11705184.
It is an arithmetic number, because the mean of its divisors is an integer number (35115537).
Almost surely, 2140462142 is an apocalyptic number.
140462142 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.
140462142 is a wasteful number, since it uses less digits than its factorization.
140462142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23410362.
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 140462142 is about 11851.6725401945. The cubic root of 140462142 is about 519.8201325644.
It can be divided in two parts, 1404 and 62142, that added together give a triangular number (63546 = T356).
The spelling of 140462142 in words is "one hundred forty million, four hundred sixty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •