Base | Representation |
---|---|
bin | 101111101101001101… |
… | …1110011011101100000 |
3 | 100210102211210212221022 |
4 | 1133122123303131200 |
5 | 3134303414011233 |
6 | 115021524545012 |
7 | 10254531605321 |
oct | 1373233633540 |
9 | 323384725838 |
10 | 102448969568 |
11 | 3a4a28551a0 |
12 | 17a31b52168 |
13 | 9878cb276a |
14 | 4d5c3ca448 |
15 | 29e9235398 |
hex | 17da6f3760 |
102448969568 has 96 divisors (see below), whose sum is σ = 227473868160. Its totient is φ = 45015183360.
The previous prime is 102448969561. The next prime is 102448969583. The reversal of 102448969568 is 865969844201.
It is a self number, because there is not a number n which added to its sum of digits gives 102448969568.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102448969561) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1433303 + ... + 1503081.
It is an arithmetic number, because the mean of its divisors is an integer number (2369519460).
Almost surely, 2102448969568 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 102448969568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113736934080).
102448969568 is an abundant number, since it is smaller than the sum of its proper divisors (125024898592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102448969568 is a wasteful number, since it uses less digits than its factorization.
102448969568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69940 (or 69932 counting only the distinct ones).
The product of its (nonzero) digits is 29859840, while the sum is 62.
The spelling of 102448969568 in words is "one hundred two billion, four hundred forty-eight million, nine hundred sixty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •