Base | Representation |
---|---|
bin | 101110110001011011… |
… | …0100010001111000000 |
3 | 100121021000200101112112 |
4 | 1131202312202033000 |
5 | 3121201313222401 |
6 | 114050455514452 |
7 | 10154030646026 |
oct | 1354266421700 |
9 | 317230611475 |
10 | 100442710976 |
11 | 39663323443 |
12 | 17572088a28 |
13 | 96194567ba |
14 | 4c0bb82716 |
15 | 292d0383bb |
hex | 1762da23c0 |
100442710976 has 56 divisors (see below), whose sum is σ = 201392918016. Its totient is φ = 49700044800.
The previous prime is 100442710967. The next prime is 100442710999. The reversal of 100442710976 is 679017244001.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 3243920 + ... + 3274736.
Almost surely, 2100442710976 is an apocalyptic number.
100442710976 is a gapful number since it is divisible by the number (16) 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 100442710976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100696459008).
100442710976 is an abundant number, since it is smaller than the sum of its proper divisors (100950207040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100442710976 is a wasteful number, since it uses less digits than its factorization.
100442710976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31357 (or 31347 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 41.
Adding to 100442710976 its reverse (679017244001), we get a palindrome (779459954977).
The spelling of 100442710976 in words is "one hundred billion, four hundred forty-two million, seven hundred ten thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.819 sec. • engine limits •