Base | Representation |
---|---|
bin | 101111111001110011… |
… | …0100011001110101000 |
3 | 100211112021100021121110 |
4 | 1133303212203032220 |
5 | 3141140012421224 |
6 | 115131451110320 |
7 | 10301146626510 |
oct | 1376346431650 |
9 | 324467307543 |
10 | 102871217064 |
11 | 3a69a135a70 |
12 | 17b2b4423a0 |
13 | 9915613455 |
14 | 4d9c502840 |
15 | 2a21340929 |
hex | 17f39a33a8 |
102871217064 has 128 divisors (see below), whose sum is σ = 320845639680. Its totient is φ = 26702457600.
The previous prime is 102871217023. The next prime is 102871217083. The reversal of 102871217064 is 460712178201.
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2963569 + ... + 2998079.
It is an arithmetic number, because the mean of its divisors is an integer number (2506606560).
Almost surely, 2102871217064 is an apocalyptic number.
102871217064 is a gapful number since it is divisible by the number (14) 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 102871217064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160422819840).
102871217064 is an abundant number, since it is smaller than the sum of its proper divisors (217974422616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102871217064 is a wasteful number, since it uses less digits than its factorization.
102871217064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36151 (or 36147 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 39.
The spelling of 102871217064 in words is "one hundred two billion, eight hundred seventy-one million, two hundred seventeen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.980 sec. • engine limits •