Base | Representation |
---|---|
bin | 10000101101010… |
… | …01000101111011 |
3 | 100202201112001200 |
4 | 20112221011323 |
5 | 241334400321 |
6 | 21523545243 |
7 | 3321165642 |
oct | 1026510573 |
9 | 322645050 |
10 | 140153211 |
11 | 72127200 |
12 | 3ab2b223 |
13 | 23061cc3 |
14 | 14884359 |
15 | c486d26 |
hex | 85a917b |
140153211 has 72 divisors (see below), whose sum is σ = 236444208. Its totient is φ = 79833600.
The previous prime is 140153207. The next prime is 140153249. The reversal of 140153211 is 112351041.
140153211 is a `hidden beast` number, since 1 + 401 + 53 + 211 = 666.
140153211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140153211 - 22 = 140153207 is a prime.
It is a super-2 number, since 2×1401532112 = 39285845107221042, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140153311) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1919871 + ... + 1919943.
Almost surely, 2140153211 is an apocalyptic number.
140153211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140153211 is a deficient number, since it is larger than the sum of its proper divisors (96290997).
140153211 is a wasteful number, since it uses less digits than its factorization.
140153211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185 (or 171 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 140153211 is about 11838.6321422705. The cubic root of 140153211 is about 519.4387571337.
It can be divided in two parts, 140 and 153211, that added together give a palindrome (153351).
The spelling of 140153211 in words is "one hundred forty million, one hundred fifty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •