Base | Representation |
---|---|
bin | 101111100010110001… |
… | …1111011101110000000 |
3 | 100202112102212100210120 |
4 | 1133011203323232000 |
5 | 3133044241412013 |
6 | 114523055100240 |
7 | 10243050205512 |
oct | 1370543735600 |
9 | 322472770716 |
10 | 102098779008 |
11 | 3a33310a906 |
12 | 17954811680 |
13 | 9821590905 |
14 | 4d27aadbb2 |
15 | 29c8610123 |
hex | 17c58fbb80 |
102098779008 has 128 divisors (see below), whose sum is σ = 281047536000. Its totient is φ = 32801298432.
The previous prime is 102098778989. The next prime is 102098779067. The reversal of 102098779008 is 800977890201.
102098779008 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6529023 + ... + 6544641.
It is an arithmetic number, because the mean of its divisors is an integer number (2195683875).
Almost surely, 2102098779008 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 102098779008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140523768000).
102098779008 is an abundant number, since it is smaller than the sum of its proper divisors (178948756992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102098779008 is a wasteful number, since it uses less digits than its factorization.
102098779008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16252 (or 16240 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 51.
The spelling of 102098779008 in words is "one hundred two billion, ninety-eight million, seven hundred seventy-nine thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •