Base | Representation |
---|---|
bin | 100000011011011… |
… | …1101100101110000 |
3 | 2210211112202000010 |
4 | 1000312331211300 |
5 | 4212031243442 |
6 | 255550454520 |
7 | 35652056415 |
oct | 10066754560 |
9 | 2724482003 |
10 | 1088149872 |
11 | 509261117 |
12 | 264504440 |
13 | 144591c84 |
14 | a473610c |
15 | 657e4b9c |
hex | 40dbd970 |
1088149872 has 160 divisors (see below), whose sum is σ = 3191795712. Its totient is φ = 317509632.
The previous prime is 1088149819. The next prime is 1088149877. The reversal of 1088149872 is 2789418801.
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 (1088149877) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 693633 + ... + 695199.
Almost surely, 21088149872 is an apocalyptic number.
1088149872 is a gapful number since it is divisible by the number (12) 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 1088149872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1595897856).
1088149872 is an abundant number, since it is smaller than the sum of its proper divisors (2103645840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1088149872 is a wasteful number, since it uses less digits than its factorization.
1088149872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655 (or 1649 counting only the distinct ones).
The product of its (nonzero) digits is 258048, while the sum is 48.
The square root of 1088149872 is about 32987.1167579102. The cubic root of 1088149872 is about 1028.5598599669.
The spelling of 1088149872 in words is "one billion, eighty-eight million, one hundred forty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •