Base | Representation |
---|---|
bin | 100001111110111… |
… | …1001100110110011 |
3 | 2221110200020211011 |
4 | 1003331321212303 |
5 | 4313404101321 |
6 | 305052331351 |
7 | 40154251261 |
oct | 10375714663 |
9 | 2843606734 |
10 | 1140300211 |
11 | 535740476 |
12 | 279a73b57 |
13 | 15232106b |
14 | ab62d431 |
15 | 6a196ae1 |
hex | 43f799b3 |
1140300211 has 8 divisors (see below), whose sum is σ = 1209172320. Its totient is φ = 1071627648.
The previous prime is 1140300197. The next prime is 1140300251. The reversal of 1140300211 is 1120030411.
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 1140300211 - 25 = 1140300179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140300191 and 1140300200.
It is not an unprimeable number, because it can be changed into a prime (1140300251) 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, 38031 + ... + 61048.
It is an arithmetic number, because the mean of its divisors is an integer number (151146540).
Almost surely, 21140300211 is an apocalyptic number.
1140300211 is a deficient number, since it is larger than the sum of its proper divisors (68872109).
1140300211 is an equidigital number, since it uses as much as digits as its factorization.
1140300211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99773.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1140300211 is about 33768.3314808416. The cubic root of 1140300211 is about 1044.7356186564.
Adding to 1140300211 its reverse (1120030411), we get a palindrome (2260330622).
The spelling of 1140300211 in words is "one billion, one hundred forty million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •