Base | Representation |
---|---|
bin | 110010101101000011… |
… | …0001000111110100000 |
3 | 101102001102201210000201 |
4 | 1211122012020332200 |
5 | 3240444222211342 |
6 | 122004343154544 |
7 | 10603201350214 |
oct | 1453206107640 |
9 | 342042653021 |
10 | 108885741472 |
11 | 421a61871a2 |
12 | 19129745a54 |
13 | a3636c6231 |
14 | 53ad212944 |
15 | 2c74396db7 |
hex | 195a188fa0 |
108885741472 has 96 divisors (see below), whose sum is σ = 232858054800. Its totient is φ = 49916805120.
The previous prime is 108885741467. The next prime is 108885741473. The reversal of 108885741472 is 274147588801.
It can be written as a sum of positive squares in 8 ways, for example, as 78666786576 + 30218954896 = 280476^2 + 173836^2 .
It is a super-2 number, since 2×1088857414722 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (108885741473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16880904 + ... + 16887352.
Almost surely, 2108885741472 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 108885741472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116429027400).
108885741472 is an abundant number, since it is smaller than the sum of its proper divisors (123972313328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108885741472 is a wasteful number, since it uses less digits than its factorization.
108885741472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7274 (or 7266 counting only the distinct ones).
The product of its (nonzero) digits is 4014080, while the sum is 55.
The spelling of 108885741472 in words is "one hundred eight billion, eight hundred eighty-five million, seven hundred forty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •