Base | Representation |
---|---|
bin | 10000101101101… |
… | …11011110001111 |
3 | 100202211111212011 |
4 | 20112313132033 |
5 | 241343241421 |
6 | 21525122051 |
7 | 3321532444 |
oct | 1026673617 |
9 | 322744764 |
10 | 140212111 |
11 | 72167486 |
12 | 3ab59327 |
13 | 23082a60 |
14 | 1489b9cb |
15 | c4994e1 |
hex | 85b778f |
140212111 has 8 divisors (see below), whose sum is σ = 151926320. Its totient is φ = 128630592.
The previous prime is 140212043. The next prime is 140212157. The reversal of 140212111 is 111212041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140212111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 140212091 and 140212100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140212181) 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, 30966 + ... + 35203.
It is an arithmetic number, because the mean of its divisors is an integer number (18990790).
Almost surely, 2140212111 is an apocalyptic number.
140212111 is a deficient number, since it is larger than the sum of its proper divisors (11714209).
140212111 is a wasteful number, since it uses less digits than its factorization.
140212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66345.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 140212111 is about 11841.1194994392. The cubic root of 140212111 is about 519.5115124127.
Adding to 140212111 its reverse (111212041), we get a palindrome (251424152).
The spelling of 140212111 in words is "one hundred forty million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •