Base | Representation |
---|---|
bin | 100001111110100… |
… | …0001011111001011 |
3 | 2221110020120111200 |
4 | 1003331001133023 |
5 | 4313324222342 |
6 | 305043355243 |
7 | 40152303153 |
oct | 10375013713 |
9 | 2843216450 |
10 | 1140070347 |
11 | 5355a37a9 |
12 | 279982b23 |
13 | 152270550 |
14 | ab5ad763 |
15 | 6a14d94c |
hex | 43f417cb |
1140070347 has 24 divisors (see below), whose sum is σ = 1781886288. Its totient is φ = 698241600.
The previous prime is 1140070343. The next prime is 1140070361. The reversal of 1140070347 is 7430700411.
It is not a de Polignac number, because 1140070347 - 22 = 1140070343 is a prime.
It is a super-2 number, since 2×11400703472 = 2599520792217400818, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1140070347.
It is not an unprimeable number, because it can be changed into a prime (1140070343) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 1597 + ... + 47777.
It is an arithmetic number, because the mean of its divisors is an integer number (74245262).
Almost surely, 21140070347 is an apocalyptic number.
1140070347 is a deficient number, since it is larger than the sum of its proper divisors (641815941).
1140070347 is a wasteful number, since it uses less digits than its factorization.
1140070347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46411 (or 46408 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 27.
The square root of 1140070347 is about 33764.9277653603. The cubic root of 1140070347 is about 1044.6654139728.
Adding to 1140070347 its reverse (7430700411), we get a palindrome (8570770758).
The spelling of 1140070347 in words is "one billion, one hundred forty million, seventy thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •