Base | Representation |
---|---|
bin | 110000011111011001… |
… | …0000011000111000000 |
3 | 100221210011201020022002 |
4 | 1200332302003013000 |
5 | 3201230411204212 |
6 | 115500545203132 |
7 | 10344333556601 |
oct | 1407662030700 |
9 | 327704636262 |
10 | 104132522432 |
11 | 401871043a4 |
12 | 182219304a8 |
13 | 9a86a20aa3 |
14 | 507bc2dda8 |
15 | 2a96e3aac2 |
hex | 183ec831c0 |
104132522432 has 112 divisors (see below), whose sum is σ = 222465180672. Its totient is φ = 48186716160.
The previous prime is 104132522419. The next prime is 104132522477. The reversal of 104132522432 is 234225231401.
It is a junction number, because it is equal to n+sod(n) for n = 104132522395 and 104132522404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20135207 + ... + 20140377.
It is an arithmetic number, because the mean of its divisors is an integer number (1986296256).
Almost surely, 2104132522432 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 104132522432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111232590336).
104132522432 is an abundant number, since it is smaller than the sum of its proper divisors (118332658240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104132522432 is a wasteful number, since it uses less digits than its factorization.
104132522432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5506 (or 5496 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 104132522432 its reverse (234225231401), we get a palindrome (338357753833).
The spelling of 104132522432 in words is "one hundred four billion, one hundred thirty-two million, five hundred twenty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •