Base | Representation |
---|---|
bin | 1000001010010010010… |
… | …1010100101111111011 |
3 | 111101212210102011011212 |
4 | 2002210211110233323 |
5 | 4244112222414321 |
6 | 144223532513335 |
7 | 13062202022210 |
oct | 2024445245773 |
9 | 441783364155 |
10 | 140200201211 |
11 | 545053a4294 |
12 | 2320891b84b |
13 | 102b41b9a55 |
14 | 6b00063b07 |
15 | 39a85ba55b |
hex | 20a4954bfb |
140200201211 has 4 divisors (see below), whose sum is σ = 160228801392. Its totient is φ = 120171601032.
The previous prime is 140200201201. The next prime is 140200201241. The reversal of 140200201211 is 112102002041.
It is a happy number.
140200201211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 140200201211 - 234 = 123020332027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140200201201) 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 3 ways as a sum of consecutive naturals, for example, 10014300080 + ... + 10014300093.
It is an arithmetic number, because the mean of its divisors is an integer number (40057200348).
Almost surely, 2140200201211 is an apocalyptic number.
140200201211 is a deficient number, since it is larger than the sum of its proper divisors (20028600181).
140200201211 is an equidigital number, since it uses as much as digits as its factorization.
140200201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20028600180.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 140200201211 its reverse (112102002041), we get a palindrome (252302203252).
The spelling of 140200201211 in words is "one hundred forty billion, two hundred million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •