Base | Representation |
---|---|
bin | 101000010000010… |
… | …1001101100000000 |
3 | 10111010122112022222 |
4 | 1100200221230000 |
5 | 10231242033030 |
6 | 342010550212 |
7 | 45321033461 |
oct | 12040515400 |
9 | 3433575288 |
10 | 1350736640 |
11 | 633501480 |
12 | 318438368 |
13 | 186ac0766 |
14 | cb56ad68 |
15 | 7d8b33e5 |
hex | 50829b00 |
1350736640 has 288 divisors, whose sum is σ = 3807530496. Its totient is φ = 454164480.
The previous prime is 1350736637. The next prime is 1350736661. The reversal of 1350736640 is 466370531.
It is a self number, because there is not a number n which added to its sum of digits gives 1350736640.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13925072 + ... + 13925168.
It is an arithmetic number, because the mean of its divisors is an integer number (13220592).
Almost surely, 21350736640 is an apocalyptic number.
1350736640 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 1350736640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1903765248).
1350736640 is an abundant number, since it is smaller than the sum of its proper divisors (2456793856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350736640 is a wasteful number, since it uses less digits than its factorization.
1350736640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195 (or 181 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 35.
The square root of 1350736640 is about 36752.3691753334. The cubic root of 1350736640 is about 1105.4104356298.
The spelling of 1350736640 in words is "one billion, three hundred fifty million, seven hundred thirty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •