Base | Representation |
---|---|
bin | 101110111000010011… |
… | …1100100111110011100 |
3 | 100121212010021101020000 |
4 | 1131300213210332130 |
5 | 3122134424433233 |
6 | 114125430054300 |
7 | 10162534041045 |
oct | 1356047447634 |
9 | 317763241200 |
10 | 100673671068 |
11 | 39771732153 |
12 | 176174aa390 |
13 | 9655260a89 |
14 | 4c307038cc |
15 | 294345ad13 |
hex | 17709e4f9c |
100673671068 has 120 divisors (see below), whose sum is σ = 266837728080. Its totient is φ = 33093100800.
The previous prime is 100673671051. The next prime is 100673671069. The reversal of 100673671068 is 860176376001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100673671069) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 16158978 + ... + 16165206.
It is an arithmetic number, because the mean of its divisors is an integer number (2223647734).
Almost surely, 2100673671068 is an apocalyptic number.
100673671068 is a gapful number since it is divisible by the number (18) 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 100673671068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133418864040).
100673671068 is an abundant number, since it is smaller than the sum of its proper divisors (166164057012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100673671068 is a wasteful number, since it uses less digits than its factorization.
100673671068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6929 (or 6918 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 100673671068 in words is "one hundred billion, six hundred seventy-three million, six hundred seventy-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •