Base | Representation |
---|---|
bin | 101111110110001011… |
… | …1001101111000000000 |
3 | 100211012210210110121220 |
4 | 1133230113031320000 |
5 | 3140412414210203 |
6 | 115111431515040 |
7 | 10265143344360 |
oct | 1375427157000 |
9 | 324183713556 |
10 | 102749756928 |
11 | 3a637617195 |
12 | 17ab6828a80 |
13 | 98c63c7a50 |
14 | 4d8a3269a0 |
15 | 2a1584c653 |
hex | 17ec5cde00 |
102749756928 has 640 divisors, whose sum is σ = 363240751104. Its totient is φ = 25060147200.
The previous prime is 102749756881. The next prime is 102749756947. The reversal of 102749756928 is 829657947201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 99659773 + ... + 99660803.
Almost surely, 2102749756928 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 102749756928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181620375552).
102749756928 is an abundant number, since it is smaller than the sum of its proper divisors (260490994176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102749756928 is a wasteful number, since it uses less digits than its factorization.
102749756928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1126 (or 1110 counting only the distinct ones).
The product of its (nonzero) digits is 15240960, while the sum is 60.
The spelling of 102749756928 in words is "one hundred two billion, seven hundred forty-nine million, seven hundred fifty-six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •