Base | Representation |
---|---|
bin | 111011101011001… |
… | …000110101101100 |
3 | 2120202212102000100 |
4 | 323223020311230 |
5 | 4022244223030 |
6 | 243202231100 |
7 | 33544516614 |
oct | 7353106554 |
9 | 2522772010 |
10 | 1001164140 |
11 | 474149489 |
12 | 23b355490 |
13 | 12c557022 |
14 | 96d71a44 |
15 | 5cd61360 |
hex | 3bac8d6c |
1001164140 has 72 divisors (see below), whose sum is σ = 3039826608. Its totient is φ = 266716800.
The previous prime is 1001164123. The next prime is 1001164181. The reversal of 1001164140 is 414611001.
1001164140 is a `hidden beast` number, since 10 + 0 + 11 + 641 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 245115 + ... + 249165.
It is an arithmetic number, because the mean of its divisors is an integer number (42219814).
Almost surely, 21001164140 is an apocalyptic number.
1001164140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001164140 is an abundant number, since it is smaller than the sum of its proper divisors (2038662468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001164140 is a wasteful number, since it uses less digits than its factorization.
1001164140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5439 (or 5434 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 1001164140 is about 31641.1779173911. The cubic root of 1001164140 is about 1000.3878961838.
Adding to 1001164140 its reverse (414611001), we get a palindrome (1415775141).
The spelling of 1001164140 in words is "one billion, one million, one hundred sixty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •