Base | Representation |
---|---|
bin | 110011101010110001… |
… | …0000101110111011100 |
3 | 101121101202112122212110 |
4 | 1213111202011313130 |
5 | 3304214401310312 |
6 | 122550042234020 |
7 | 11005416050061 |
oct | 1472542056734 |
9 | 347352478773 |
10 | 110956666332 |
11 | 43069166746 |
12 | 196071b5910 |
13 | a603774065 |
14 | 5528290c68 |
15 | 2d460b943c |
hex | 19d5885ddc |
110956666332 has 48 divisors (see below), whose sum is σ = 270182626560. Its totient is φ = 35373917568.
The previous prime is 110956666319. The next prime is 110956666339. The reversal of 110956666332 is 233666659011.
It is a super-2 number, since 2×1109566663322 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110956666339) 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, 4736344 + ... + 4759712.
It is an arithmetic number, because the mean of its divisors is an integer number (5628804720).
Almost surely, 2110956666332 is an apocalyptic number.
110956666332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110956666332 is an abundant number, since it is smaller than the sum of its proper divisors (159225960228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110956666332 is a wasteful number, since it uses less digits than its factorization.
110956666332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40602 (or 40600 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 48.
The spelling of 110956666332 in words is "one hundred ten billion, nine hundred fifty-six million, six hundred sixty-six thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •