Base | Representation |
---|---|
bin | 110000011010011101… |
… | …0100100001011101100 |
3 | 100221100122012221202000 |
4 | 1200310322210023230 |
5 | 3200411021423032 |
6 | 115432313132300 |
7 | 10340253526203 |
oct | 1406472441354 |
9 | 327318187660 |
10 | 103966982892 |
11 | 40101719063 |
12 | 181963ba090 |
13 | 9a5b640ab6 |
14 | 5063c5c23a |
15 | 2a8763be7c |
hex | 1834ea42ec |
103966982892 has 192 divisors, whose sum is σ = 313484774400. Its totient is φ = 29556679680.
The previous prime is 103966982881. The next prime is 103966982941. The reversal of 103966982892 is 298289669301.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 737542 + ... + 867122.
It is an arithmetic number, because the mean of its divisors is an integer number (1632733200).
Almost surely, 2103966982892 is an apocalyptic number.
103966982892 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 103966982892, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156742387200).
103966982892 is an abundant number, since it is smaller than the sum of its proper divisors (209517791508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103966982892 is a wasteful number, since it uses less digits than its factorization.
103966982892 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129653 (or 129645 counting only the distinct ones).
The product of its (nonzero) digits is 20155392, while the sum is 63.
The spelling of 103966982892 in words is "one hundred three billion, nine hundred sixty-six million, nine hundred eighty-two thousand, eight hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •