Base | Representation |
---|---|
bin | 101111101110111011… |
… | …1000001000001000000 |
3 | 100210120211221102011201 |
4 | 1133131313001001000 |
5 | 3134413121401444 |
6 | 115031340350544 |
7 | 10256130214036 |
oct | 1373567010100 |
9 | 323524842151 |
10 | 102506434624 |
11 | 3a522234580 |
12 | 17a49245454 |
13 | 9887b82959 |
14 | 4d65ca8556 |
15 | 29ee2d6dd4 |
hex | 17dddc1040 |
102506434624 has 112 divisors (see below), whose sum is σ = 235945923840. Its totient is φ = 43668316160.
The previous prime is 102506434621. The next prime is 102506434627. The reversal of 102506434624 is 426434605201.
It is an interprime number because it is at equal distance from previous prime (102506434621) and next prime (102506434627).
It is not an unprimeable number, because it can be changed into a prime (102506434621) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2842434 + ... + 2878270.
Almost surely, 2102506434624 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 102506434624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117972961920).
102506434624 is an abundant number, since it is smaller than the sum of its proper divisors (133439489216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102506434624 is a wasteful number, since it uses less digits than its factorization.
102506434624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36116 (or 36106 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 102506434624 in words is "one hundred two billion, five hundred six million, four hundred thirty-four thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •