Base | Representation |
---|---|
bin | 100001111110111… |
… | …1110110010000100 |
3 | 2221110201022220101 |
4 | 1003331332302010 |
5 | 4313410241122 |
6 | 305053013444 |
7 | 40154400136 |
oct | 10375766204 |
9 | 2843638811 |
10 | 1140321412 |
11 | 53575539a |
12 | 279a84284 |
13 | 15232a8c9 |
14 | ab637056 |
15 | 6a19d027 |
hex | 43f7ec84 |
1140321412 has 12 divisors (see below), whose sum is σ = 2064375180. Its totient is φ = 550499936.
The previous prime is 1140321361. The next prime is 1140321433. The reversal of 1140321412 is 2141230411.
It can be written as a sum of positive squares in 2 ways, for example, as 232745536 + 907575876 = 15256^2 + 30126^2 .
It is a super-3 number, since 3×11403214123 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1140321412.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4915063 + ... + 4915294.
It is an arithmetic number, because the mean of its divisors is an integer number (172031265).
Almost surely, 21140321412 is an apocalyptic number.
It is an amenable number.
1140321412 is a deficient number, since it is larger than the sum of its proper divisors (924053768).
1140321412 is a wasteful number, since it uses less digits than its factorization.
1140321412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9830390 (or 9830388 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1140321412 is about 33768.6453977651. The cubic root of 1140321412 is about 1044.7420933556.
Adding to 1140321412 its reverse (2141230411), we get a palindrome (3281551823).
The spelling of 1140321412 in words is "one billion, one hundred forty million, three hundred twenty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •