Base | Representation |
---|---|
bin | 100001111011111… |
… | …1111110100000000 |
3 | 2221100202122010110 |
4 | 1003313333310000 |
5 | 4313010042033 |
6 | 304555231320 |
7 | 40135144626 |
oct | 10367776400 |
9 | 2840678113 |
10 | 1138752768 |
11 | 53488389a |
12 | 279448540 |
13 | 151bcb90a |
14 | ab349516 |
15 | 69e8d363 |
hex | 43dffd00 |
1138752768 has 108 divisors (see below), whose sum is σ = 3091672640. Its totient is φ = 372043776.
The previous prime is 1138752763. The next prime is 1138752809. The reversal of 1138752768 is 8672578311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1138752761) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 8311996 + ... + 8312132.
Almost surely, 21138752768 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 1138752768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1545836320).
1138752768 is an abundant number, since it is smaller than the sum of its proper divisors (1952919872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1138752768 is an frugal number, since it uses more digits than its factorization.
1138752768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372 (or 221 counting only the distinct ones).
The product of its digits is 564480, while the sum is 48.
The square root of 1138752768 is about 33745.4110658027. The cubic root of 1138752768 is about 1044.2628189920.
The spelling of 1138752768 in words is "one billion, one hundred thirty-eight million, seven hundred fifty-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •