Base | Representation |
---|---|
bin | 10001110010110100101… |
… | …10011111010111110100 |
3 | 2011110010121020002020010 |
4 | 20321122112133113310 |
5 | 40004122201414030 |
6 | 1144512425340220 |
7 | 62113043314332 |
oct | 10713226372764 |
9 | 2143117202203 |
10 | 611401201140 |
11 | 216326047784 |
12 | 9a5b1037670 |
13 | 45868a27082 |
14 | 2184054cb52 |
15 | 10d85c5b6b0 |
hex | 8e5a59f5f4 |
611401201140 has 24 divisors (see below), whose sum is σ = 1711923363360. Its totient is φ = 163040320288.
The previous prime is 611401201123. The next prime is 611401201223. The reversal of 611401201140 is 41102104116.
It is a super-2 number, since 2×6114012011402 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5095009950 + ... + 5095010069.
It is an arithmetic number, because the mean of its divisors is an integer number (71330140140).
Almost surely, 2611401201140 is an apocalyptic number.
611401201140 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
611401201140 is an abundant number, since it is smaller than the sum of its proper divisors (1100522162220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
611401201140 is a wasteful number, since it uses less digits than its factorization.
611401201140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10190020031 (or 10190020029 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 611401201140 its reverse (41102104116), we get a palindrome (652503305256).
The spelling of 611401201140 in words is "six hundred eleven billion, four hundred one million, two hundred one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •