Base | Representation |
---|---|
bin | 100001111010001… |
… | …1100000000000000 |
3 | 2221022000020010110 |
4 | 1003310130000000 |
5 | 4312240212043 |
6 | 304523231320 |
7 | 40124210310 |
oct | 10364340000 |
9 | 2838006113 |
10 | 1137819648 |
11 | 5342a6819 |
12 | 279078540 |
13 | 151962c84 |
14 | ab185440 |
15 | 69d56b33 |
hex | 43d1c000 |
1137819648 has 120 divisors (see below), whose sum is σ = 3468583552. Its totient is φ = 324993024.
The previous prime is 1137819619. The next prime is 1137819649. The reversal of 1137819648 is 8469187311.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 1137819597 and 1137819606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1137819649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 342411 + ... + 345717.
Almost surely, 21137819648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1137819648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1734291776).
1137819648 is an abundant number, since it is smaller than the sum of its proper divisors (2330763904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1137819648 is an frugal number, since it uses more digits than its factorization.
1137819648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3345 (or 3319 counting only the distinct ones).
The product of its digits is 290304, while the sum is 48.
The square root of 1137819648 is about 33731.5823524483. The cubic root of 1137819648 is about 1043.9775101217.
The spelling of 1137819648 in words is "one billion, one hundred thirty-seven million, eight hundred nineteen thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •