Base | Representation |
---|---|
bin | 1000001010011110101… |
… | …1010110000101101011 |
3 | 111102000102002110022110 |
4 | 2002213223112011223 |
5 | 4244214020024321 |
6 | 144233025253403 |
7 | 13063402163262 |
oct | 2024753260553 |
9 | 442012073273 |
10 | 140252111211 |
11 | 5453172a013 |
12 | 23222194263 |
13 | 102c1b93624 |
14 | 6b06cd75d9 |
15 | 39ace21176 |
hex | 20a7ad616b |
140252111211 has 8 divisors (see below), whose sum is σ = 187027525584. Its totient is φ = 93489052160.
The previous prime is 140252111203. The next prime is 140252111221. The reversal of 140252111211 is 112111252041.
140252111211 is digitally balanced in base 2, because in such base 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.
It is a cyclic number.
It is not a de Polignac number, because 140252111211 - 23 = 140252111203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140252111221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3062310 + ... + 3107771.
It is an arithmetic number, because the mean of its divisors is an integer number (23378440698).
Almost surely, 2140252111211 is an apocalyptic number.
140252111211 is a deficient number, since it is larger than the sum of its proper divisors (46775414373).
140252111211 is an equidigital number, since it uses as much as digits as its factorization.
140252111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6177661.
The product of its (nonzero) digits is 160, while the sum is 21.
Adding to 140252111211 its reverse (112111252041), we get a palindrome (252363363252).
The spelling of 140252111211 in words is "one hundred forty billion, two hundred fifty-two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •