Base | Representation |
---|---|
bin | 10000101101101… |
… | …11010011010101 |
3 | 100202211110220022 |
4 | 20112313103111 |
5 | 241343231123 |
6 | 21525114525 |
7 | 3321530426 |
oct | 1026672325 |
9 | 322743808 |
10 | 140211413 |
11 | 72166a01 |
12 | 3ab58a45 |
13 | 23082644 |
14 | 1489b64d |
15 | c4991c8 |
hex | 85b74d5 |
140211413 has 4 divisors (see below), whose sum is σ = 140710668. Its totient is φ = 139712160.
The previous prime is 140211373. The next prime is 140211437. The reversal of 140211413 is 314112041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41049649 + 99161764 = 6407^2 + 9958^2 .
It is a cyclic number.
It is not a de Polignac number, because 140211413 - 28 = 140211157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140211391 and 140211400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140211493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249206 + ... + 249767.
It is an arithmetic number, because the mean of its divisors is an integer number (35177667).
Almost surely, 2140211413 is an apocalyptic number.
It is an amenable number.
140211413 is a deficient number, since it is larger than the sum of its proper divisors (499255).
140211413 is an equidigital number, since it uses as much as digits as its factorization.
140211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499254.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 140211413 is about 11841.0900258380. The cubic root of 140211413 is about 519.5106503387.
Adding to 140211413 its reverse (314112041), we get a palindrome (454323454).
The spelling of 140211413 in words is "one hundred forty million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •