Base | Representation |
---|---|
bin | 10000101111011… |
… | …01111001101101 |
3 | 100210020211200021 |
4 | 20113231321231 |
5 | 241422410203 |
6 | 21534002141 |
7 | 3323451433 |
oct | 1027557155 |
9 | 323224607 |
10 | 140435053 |
11 | 722a9a30 |
12 | 3b046351 |
13 | 23130385 |
14 | 14918d53 |
15 | c4e05bd |
hex | 85ede6d |
140435053 has 8 divisors (see below), whose sum is σ = 158144256. Its totient is φ = 123549600.
The previous prime is 140435051. The next prime is 140435093. The reversal of 140435053 is 350534041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140435053 - 21 = 140435051 is a prime.
It is a super-2 number, since 2×1404350532 = 39444008222225618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140435051) 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 7 ways as a sum of consecutive naturals, for example, 205576 + ... + 206257.
It is an arithmetic number, because the mean of its divisors is an integer number (19768032).
Almost surely, 2140435053 is an apocalyptic number.
It is an amenable number.
140435053 is a deficient number, since it is larger than the sum of its proper divisors (17709203).
140435053 is a wasteful number, since it uses less digits than its factorization.
140435053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411875.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 140435053 is about 11850.5296506106. The cubic root of 140435053 is about 519.7867135646.
Adding to 140435053 its reverse (350534041), we get a palindrome (490969094).
The spelling of 140435053 in words is "one hundred forty million, four hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •