Base | Representation |
---|---|
bin | 101111101111101101… |
… | …0111011110110001000 |
3 | 100210122200020011112010 |
4 | 1133133122323312020 |
5 | 3134441323042343 |
6 | 115034114015520 |
7 | 10256565646110 |
oct | 1373732736610 |
9 | 323580204463 |
10 | 102532627848 |
11 | 3a535aa4972 |
12 | 17a55b775a0 |
13 | 9890423cc1 |
14 | 4d69566040 |
15 | 2a0175cd33 |
hex | 17df6bbd88 |
102532627848 has 128 divisors (see below), whose sum is σ = 301633056000. Its totient is φ = 28430797824.
The previous prime is 102532627823. The next prime is 102532627859. The reversal of 102532627848 is 848726235201.
It is a super-2 number, since 2×1025326278482 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102532627797 and 102532627806.
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, 2446978 + ... + 2488526.
It is an arithmetic number, because the mean of its divisors is an integer number (2356508250).
Almost surely, 2102532627848 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 102532627848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150816528000).
102532627848 is an abundant number, since it is smaller than the sum of its proper divisors (199100428152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102532627848 is a wasteful number, since it uses less digits than its factorization.
102532627848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41999 (or 41995 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 48.
The spelling of 102532627848 in words is "one hundred two billion, five hundred thirty-two million, six hundred twenty-seven thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •