Base | Representation |
---|---|
bin | 110000010001111100… |
… | …0000111110001010000 |
3 | 100220121201100002200021 |
4 | 1200203320013301100 |
5 | 3144314332121202 |
6 | 115344102233224 |
7 | 10330213026430 |
oct | 1404370076120 |
9 | 326551302607 |
10 | 103681129552 |
11 | 3aa75327230 |
12 | 18116725814 |
13 | 9a14357100 |
14 | 5037ccc2c0 |
15 | 2a6c4c4a37 |
hex | 1823e07c50 |
103681129552 has 120 divisors (see below), whose sum is σ = 271198445760. Its totient is φ = 37287843840.
The previous prime is 103681129523. The next prime is 103681129553. The reversal of 103681129552 is 255921186301.
It is a junction number, because it is equal to n+sod(n) for n = 103681129499 and 103681129508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103681129553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40777 + ... + 457192.
It is an arithmetic number, because the mean of its divisors is an integer number (2259987048).
Almost surely, 2103681129552 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 103681129552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135599222880).
103681129552 is an abundant number, since it is smaller than the sum of its proper divisors (167517316208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103681129552 is a wasteful number, since it uses less digits than its factorization.
103681129552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498021 (or 498002 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 103681129552 in words is "one hundred three billion, six hundred eighty-one million, one hundred twenty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •