Base | Representation |
---|---|
bin | 101000101001110… |
… | …1001110000000000 |
3 | 10112001210202222100 |
4 | 1101103221300000 |
5 | 10243202344430 |
6 | 343205310400 |
7 | 45542466060 |
oct | 12123516000 |
9 | 3461722870 |
10 | 1364106240 |
11 | 640003232 |
12 | 320a05400 |
13 | 1897c1c73 |
14 | cd24b3a0 |
15 | 7eb54960 |
hex | 514e9c00 |
1364106240 has 264 divisors, whose sum is σ = 5403097440. Its totient is φ = 311721984.
The previous prime is 1364106223. The next prime is 1364106253. The reversal of 1364106240 is 426014631.
1364106240 is a `hidden beast` number, since 1 + 3 + 6 + 410 + 6 + 240 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 320446 + ... + 324674.
Almost surely, 21364106240 is an apocalyptic number.
1364106240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1364106240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2701548720).
1364106240 is an abundant number, since it is smaller than the sum of its proper divisors (4038991200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1364106240 is a wasteful number, since it uses less digits than its factorization.
1364106240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4267 (or 4246 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 1364106240 is about 36933.8089018720. The cubic root of 1364106240 is about 1109.0455881736.
The spelling of 1364106240 in words is "one billion, three hundred sixty-four million, one hundred six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •